Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility.
Simon TheveninNicolas ZuffereyJean-Yves PotvinPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- parallel machine scheduling problem
- parallel machines
- scheduling problem
- release dates
- maximum lateness
- sequence dependent setup times
- total weighted tardiness
- scheduling jobs
- flowshop
- single machine
- processing times
- batch processing
- precedence constraints
- completion times
- single machine scheduling problem
- batch processing machines
- single server
- shared memory
- setup times
- lagrangian relaxation
- lot sizing
- np hard
- evolutionary algorithm
- partial order
- special case