Scheduling a single machine with multiple job processing ability to minimize makespan.
Xianpeng WangLixin TangPublished in: J. Oper. Res. Soc. (2011)
Keyphrases
- single machine
- release times
- maximum lateness
- release dates
- scheduling problem
- scheduling jobs
- processing times
- deteriorating jobs
- identical machines
- minimize total
- weighted tardiness
- single machine scheduling problem
- flowshop
- sequence dependent setup times
- total weighted tardiness
- number of tardy jobs
- completion times
- batch processing
- earliness tardiness
- job processing times
- total tardiness
- precedence constraints
- rolling horizon
- weighted number of tardy jobs
- identical parallel machines
- setup times
- job shop
- production scheduling
- shortest processing time
- number of late jobs
- learning effect
- dispatching rule
- parallel machines
- makespan minimization
- job shop scheduling
- tabu search
- competitive ratio
- scheduling algorithm
- branch and bound algorithm
- production system