High-multiplicity cyclic job shop scheduling.
Tracy KimbrelMaxim SviridenkoPublished in: Oper. Res. Lett. (2008)
Keyphrases
- high multiplicity
- job shop scheduling
- job shop scheduling problem
- scheduling problem
- tabu search
- benchmark problems
- genetic algorithm
- simulated annealing
- memetic algorithm
- single machine
- flowshop
- combinatorial optimization problems
- np hard
- processing times
- combinatorial optimization
- graph model
- special case
- optimization problems
- upper bound