The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
Jamal OuennicheFayez F. BoctorPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- scheduling problem
- randomly generated test problems
- strongly np hard
- tabu search
- graph coloring problems
- single machine
- list scheduling
- flowshop
- np hard
- quay crane
- job shop scheduling problem
- unrelated parallel machines
- permutation flowshop
- life cycle
- search algorithm
- minimizing makespan
- parallel machines
- processing times
- precedence constraints
- mixed integer program
- product design
- optimal solution
- feasible solution