Bidirectional Flow Shop Scheduling with Multi-Machine Capacity and Critical Operations Sequencing
Conference Proceeding Article
We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function - both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. A Lagrangian-based heuristics procedure is used to further reduce the duality gap. The performance of the heuristic and Lagrangian relaxation is compared with optimal solutions experimentally.
Flow shop, Job shop, Machine capacity, Critical operation sequencing
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IEEE Multi-Conference on Systems and Control
ZHAO, ZhengYi; LEONG, Thin Yin; Ge, Shuzhi Sam; and LAU, Hoong Chuin.
Bidirectional Flow Shop Scheduling with Multi-Machine Capacity and Critical Operations Sequencing. (2007). IEEE Multi-Conference on Systems and Control. 446-451. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/398
This document is currently not available here.