Single machine due-date scheduling of jobs with decreasing start-time dependent processing times.
T. C. E. ChengL. Y. KangC. T. NgPublished in: Int. Trans. Oper. Res. (2005)
Keyphrases
- processing times
- single machine
- scheduling problem
- release dates
- identical machines
- identical parallel machines
- scheduling jobs
- release times
- minimize total
- maximum lateness
- number of tardy jobs
- total weighted tardiness
- weighted tardiness
- sequence dependent setup times
- tardiness cost
- setup times
- precedence relations
- job processing times
- earliness tardiness
- single machine scheduling problem
- makespan minimization
- competitive ratio
- scheduling decisions
- deteriorating jobs
- production scheduling
- flowshop
- dynamic programming
- completion times
- precedence constraints
- parallel machines
- learning effect
- weighted number of tardy jobs
- number of late jobs
- polynomially solvable
- job shop
- np hard
- tabu search
- strongly np hard