Scheduling on parallel machines to minimise maximum lateness for the customer order problem.
Ling-Huey SuPing-Shun ChenSzu-Yin ChenPublished in: Int. J. Syst. Sci. (2013)
Keyphrases
- parallel machines
- maximum lateness
- scheduling problem
- sequence dependent setup times
- precedence constraints
- release dates
- unrelated parallel machines
- single machine
- minimize total
- scheduling jobs
- parallel computing
- flowshop
- batch processing machines
- setup times
- single server
- lot sizing
- processing times
- approximation algorithms
- branch and bound algorithm