A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival.
Tsung-Che ChiangHsueh-Chien ChengLi-Chen FuPublished in: Comput. Oper. Res. (2010)
Keyphrases
- memetic algorithm
- total weighted tardiness
- job shop scheduling problem
- parallel machine scheduling problem
- job shop
- flowshop
- tabu search
- scheduling problem
- parallel machines
- single machine
- sequence dependent setup times
- job shop scheduling
- processing times
- single machine scheduling problem
- production scheduling
- benchmark instances
- maximum lateness
- release dates
- tardiness cost
- genetic algorithm
- vehicle routing problem
- feasible solution
- evolutionary computation
- special case
- precedence constraints
- metaheuristic
- shared memory
- steady state
- simulated annealing
- multi objective
- computational complexity