Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs.
Javad NavaeiSeyyed Mohammad Taghi Fatemi GhomiFariborz JolaiAshkan MozdgirPublished in: Comput. Oper. Res. (2014)
Keyphrases
- flowshop
- sequence dependent setup times
- scheduling problem
- completion times
- flowshop scheduling problems
- setup times
- special case
- parallel machines
- single machine
- manufacturing cell
- total weighted tardiness
- processing times
- single machine scheduling problem
- total tardiness
- tardiness cost
- tabu search
- maximum lateness
- precedence constraints
- search algorithm
- setup cost
- job shop
- job shop scheduling problem
- expected cost
- lot sizing
- knapsack problem
- supply chain
- dynamic programming
- search space
- computational complexity