Scheduling an unbounded batching machine with family jobs and setup times.
R. ZhengH. LiXiandong ZhangPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- setup times
- scheduling problem
- flowshop
- unrelated parallel machines
- strongly np hard
- parallel machines
- sequence dependent setup times
- identical parallel machines
- manufacturing cell
- processing times
- identical machines
- special case
- single machine
- scheduling jobs
- weighted tardiness
- precedence constraints
- release dates
- lot sizing
- total tardiness
- multi item
- single machine scheduling problem
- np hard
- job shop
- completion times
- minimize total
- lagrangian relaxation
- tabu search
- open shop
- batch processing
- single server
- job shop scheduling problem
- scheduling decisions
- branch and bound algorithm