Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times.
Jun PeiXinbao LiuPanos M. PardalosWenjuan FanShanlin YangPublished in: Ann. Oper. Res. (2017)
Keyphrases
- sequence dependent setup times
- deteriorating jobs
- single machine
- maximum lateness
- flowshop
- scheduling problem
- release dates
- single machine scheduling problem
- release times
- scheduling jobs
- processing times
- setup times
- parallel machine scheduling problem
- precedence constraints
- parallel machines
- tardiness penalties
- identical machines
- completion times
- batch processing
- identical parallel machines
- branch and bound algorithm
- strongly np hard
- production scheduling
- np hard
- special case
- minimizing makespan
- tabu search
- optimal solution
- job shop
- search procedure
- approximation algorithms