Applying machine based decomposition in 2-machine flow shops

The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show that for the 2-machine Flow Shop problem, the SB heurisitc will deliver the optimal solution in only a small number of instances. We examine the reason behind the failure of the machine based decomposition method for the Flow Shop. An optimal machine based decomposition procedure is formulated for the 2-machine Flow Shop, the time complexity of which is worse than that of the celebrated Johnson's Rule. The contribution of the present study lies in showing that the same machine based decomposition procedures which are so successful in solving complex Job Shops can also be suitably modified to ...

• Type: Journal
• Year: 2006
• Where: EOR
• Authors: Saral Mukherjee, A. K. Chatterjee
• Keywords: Decomposition Procedures, EOR 2006, Flow Shops, Shop Problem