Single machine scheduling with sequence-dependent family setups to minimize maximum lateness.
Feng JinJatinder N. D. GuptaShiji SongCheng WuPublished in: J. Oper. Res. Soc. (2010)
Keyphrases
- maximum lateness
- precedence constraints
- deteriorating jobs
- single machine
- completion times
- scheduling problem
- flowshop
- branch and bound algorithm
- sequence dependent setup times
- release dates
- parallel machines
- single machine scheduling problem
- special case
- processing times
- setup times
- batch processing machines
- global constraints
- approximation algorithms
- partially ordered
- partial order
- np hard
- objective function