An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan.
Ching-Jong LiaoCheng-Hsiung LeeHong-Chieh LeePublished in: Comput. Ind. Eng. (2015)
Keyphrases
- setup times
- scheduling problem
- unrelated parallel machines
- strongly np hard
- tabu search
- manufacturing cell
- flowshop
- lagrangian relaxation
- single machine
- processing times
- job shop scheduling problem
- sequence dependent setup times
- lot sizing
- multi item
- total tardiness
- parallel machines
- np hard
- precedence constraints
- optimal solution
- dynamic programming
- single machine scheduling problem
- feasible solution
- scheduling jobs
- mixed integer programming
- single server
- combinatorial optimization
- special case
- search algorithm
- search procedure
- integer programming
- release dates
- lower bound