High-multiplicity scheduling on one machine with forbidden start and completion times.
Michaël GabayChristophe RapineNadia BraunerPublished in: J. Sched. (2016)
Keyphrases
- completion times
- scheduling problem
- single machine
- flowshop
- unrelated parallel machines
- processing times
- weighted sum
- release times
- single machine scheduling problem
- absolute deviation
- open shop
- scheduling jobs
- parallel machines
- setup times
- release dates
- queue length
- shortest processing time
- identical parallel machines
- response time
- lower bound
- batch processing
- branch and bound algorithm
- np hard