Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times.
Joseph Y.-T. LeungC. T. NgT. C. Edwin ChengPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- processing times
- sum of completion times
- scheduling problem
- completion times
- single machine
- flowshop
- number of tardy jobs
- setup times
- single machine scheduling problem
- release dates
- earliness tardiness
- precedence relations
- identical machines
- np hard
- worst case performance ratio
- tabu search
- total weighted tardiness
- makespan minimization
- release times
- identical parallel machines
- scheduling jobs
- parallel machines
- job shop scheduling problem
- lower bound
- polynomially solvable
- precedence constraints
- sequence dependent setup times
- resource consumption
- search procedure
- competitive ratio
- job processing times
- genetic algorithm