A modified column generation heuristic for hybrid flow shop multiple orders per job scheduling problem.
Bing-Hai ZhouWen-Long LiuPublished in: Int. J. Manuf. Technol. Manag. (2019)
Keyphrases
- flowshop
- scheduling problem
- column generation
- asymptotic optimality
- grasp with path relinking
- tabu search
- lagrangean relaxation
- processing times
- optimal solution
- integer linear programming
- setup times
- mixed integer programming
- single machine
- np hard
- linear programming
- strongly np hard
- maximum lateness
- unrelated parallel machines
- minimizing makespan
- lagrangian relaxation
- sequence dependent setup times
- special case
- job shop scheduling problem
- branch and bound
- integer programming
- linear programming relaxation
- set partitioning
- job shop
- lot streaming
- integer program
- vehicle routing
- scheduling jobs
- parallel machines
- release dates
- permutation flowshop
- constraint programming
- precedence constraints
- total weighted tardiness
- linear program
- metaheuristic
- vehicle routing problem with time windows
- combinatorial optimization
- simulated annealing
- completion times
- search space
- genetic algorithm
- ant colony optimization
- solution quality
- job processing times
- objective function