Preemptive job-shop scheduling problems with a fixed number of jobs.
Peter BruckerSvetlana A. KravchenkoYuri N. SotskovPublished in: Math. Methods Oper. Res. (1999)
Keyphrases
- job shop scheduling problem
- scheduling problem
- fixed number
- identical parallel machines
- processing times
- flowshop
- job shop scheduling
- single machine
- parallel machines
- precedence constraints
- setup times
- particle swarm algorithm
- release dates
- tabu search
- strongly np hard
- sequence dependent setup times
- np hard
- completion times
- finite number
- benchmark problems
- simulated annealing
- genetic algorithm
- single machine scheduling problem
- graphical models
- competitive ratio
- multi objective
- information retrieval