Using Lagrangian Relaxation Decomposition With Heuristic to Integrate the Decisions of Cell Formation and Parts Scheduling Considering Intercell Moves.
Jiafu TangChongjun YanXiaoqing WangChengkuan ZengPublished in: IEEE Trans Autom. Sci. Eng. (2014)
Keyphrases
- lagrangian relaxation
- manufacturing cell
- setup times
- cell formation
- integer programming
- feasible solution
- lagrangian dual
- dynamic programming
- lower bound
- material handling
- lower and upper bounds
- linear programming
- mixed integer program
- np hard
- mixed integer programming
- branch and bound algorithm
- manufacturing systems
- column generation
- lagrangian heuristic
- inter cell
- single machine scheduling problem
- upper bound
- scheduling problem
- optimal solution
- constraint programming
- mathematical model
- shortest path
- layout design
- scheduling algorithm
- branch and bound
- valid inequalities
- computational complexity