Scheduling to Minimize Makespan with Time-Dependent Processing Times.
Liying KangT. C. Edwin ChengC. T. NgMin ZhaoPublished in: ISAAC (2005)
Keyphrases
- processing times
- scheduling problem
- release dates
- scheduling jobs
- identical machines
- single machine
- precedence relations
- identical parallel machines
- setup times
- number of tardy jobs
- release times
- flowshop
- resource consumption
- communication delays
- single machine scheduling problem
- job processing times
- sequence dependent setup times
- scheduling decisions
- completion times
- total weighted tardiness
- worst case performance ratio
- manufacturing cell
- earliness tardiness
- parallel machines
- makespan minimization
- np hard
- precedence constraints
- polynomially solvable
- job shop
- assembly line
- tabu search
- travel time
- response time
- scheduling algorithm
- vehicle routing