A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective.
Paulo M. FrançaMichel GendreauGilbert LaporteFelipe Martins MüllerPublished in: Comput. Oper. Res. (1994)
Keyphrases
- parallel machine scheduling problem
- scheduling problem
- release dates
- single machine
- total weighted tardiness
- parallel machines
- sequence dependent setup times
- maximum lateness
- flowshop
- processing times
- precedence constraints
- single machine scheduling problem
- setup times
- np hard
- job shop scheduling problem
- tabu search
- job shop scheduling
- job shop