Single-machine batch delivery scheduling with an assignable common due date and controllable processing times.
Yunqiang YinT. C. E. ChengShuenn-Ren ChengChin-Chia WuPublished in: Comput. Ind. Eng. (2013)
Keyphrases
- single machine
- processing times
- scheduling problem
- release dates
- scheduling jobs
- minimize total
- release times
- maximum lateness
- identical machines
- identical parallel machines
- sequence dependent setup times
- setup times
- total weighted tardiness
- number of tardy jobs
- tardiness cost
- earliness tardiness
- deteriorating jobs
- single machine scheduling problem
- production scheduling
- parallel machines
- makespan minimization
- resource consumption
- job processing times
- flowshop
- learning effect
- job shop
- precedence constraints
- completion times
- competitive ratio
- batch processing
- np hard
- dynamic programming
- polynomially solvable
- job shop scheduling
- job shop scheduling problem
- tabu search