An Investigation of Single-Machine Due-Window Assignment with Time-Dependent Processing Times and a Controllable Rate-Modifying Activity.
Chuanli ZhaoChou-Jung HsuWin-Chin LinWen-Hsiang WuChin-Chia WuPublished in: Comput. J. (2017)
Keyphrases
- processing times
- single machine
- scheduling problem
- earliness tardiness
- scheduling jobs
- total weighted tardiness
- release dates
- release times
- learning effect
- dynamic programming
- setup times
- single machine scheduling problem
- makespan minimization
- number of tardy jobs
- identical machines
- competitive ratio
- resource consumption
- sequence dependent setup times
- polynomially solvable
- production scheduling
- flowshop
- completion times