Approximation schemes for job shop scheduling problems with controllable processing times.
Klaus JansenMonaldo MastrolilliRoberto Solis-ObaPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- approximation schemes
- job shop scheduling problem
- single machine
- scheduling problem
- job shop scheduling
- approximation algorithms
- np hard
- tabu search
- benchmark problems
- particle swarm algorithm
- genetic algorithm
- combinatorial optimization problems
- memetic algorithm
- graph model
- simulated annealing
- numerical methods
- combinatorial optimization
- special case
- bin packing
- optimization problems
- state space
- objective function