Makespan minimization scheduling with ready times, group technology and shortening job processing times.
Ji-Bo WangLu LiuJian-Jun WangLin LiPublished in: Comput. J. (2018)
Keyphrases
- makespan minimization
- job processing times
- scheduling problem
- parallel machines
- processing times
- release dates
- single machine
- job shop scheduling problem
- metaheuristic
- flowshop
- special case
- total weighted tardiness
- setup times
- polynomial time approximation
- job shop scheduling
- job shop
- precedence constraints
- sequence dependent setup times
- np hard
- genetic algorithm
- tabu search
- single machine scheduling problem
- polynomially solvable
- optimization problems
- simulated annealing
- parallel computing
- combinatorial optimization
- memetic algorithm
- lagrangian relaxation
- production scheduling
- lot sizing
- search procedure
- benchmark problems