Makespan minimization in single-machine scheduling with step-deterioration of processing times.
Andy An-Kai JengBertrand M. T. LinPublished in: J. Oper. Res. Soc. (2004)
Keyphrases
- processing times
- makespan minimization
- scheduling problem
- polynomially solvable
- single machine
- total weighted tardiness
- release dates
- setup times
- single machine scheduling problem
- completion times
- flowshop
- resource consumption
- precedence constraints
- job processing times
- reinforcement learning
- sequence dependent setup times
- tabu search
- release times