Single-machine common due window assignment and scheduling to minimize the total cost.
Yunqiang YinT. C. E. ChengJiayin WangChin-Chia WuPublished in: Discret. Optim. (2013)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- job processing times
- release times
- maximum lateness
- scheduling jobs
- sequence dependent setup times
- weighted tardiness
- processing times
- total weighted tardiness
- total tardiness
- deteriorating jobs
- identical machines
- total cost
- rolling horizon
- setup times
- earliness tardiness
- production scheduling
- number of late jobs
- tardiness cost
- single machine scheduling problem
- parallel machines
- precedence constraints
- learning effect
- flowshop
- tabu search
- np hard
- competitive ratio
- job shop scheduling problem
- job shop scheduling
- completion times
- expected cost
- weighted number of tardy jobs
- parallel computing
- resource consumption
- dynamic programming
- lower bound
- reinforcement learning