Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/10032
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMukherjee, Saral
dc.contributor.authorChatterjee, A. K.
dc.date.accessioned2010-10-27T10:54:45Z
dc.date.available2010-10-27T10:54:45Z
dc.date.copyright2006
dc.date.issued2006-10-27T10:54:45Z
dc.identifier.urihttp://hdl.handle.net/11718/10032
dc.descriptionEuropean Journal of Operational Research, Vol. 169, No. 3, (March 16, 2006), pp. 723-41en
dc.description.abstractThe 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. In particular, we show that for the 2-machine flow shop problem, the SB heuristic 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 optimally solve the simpler flow shops
dc.language.isoenen
dc.subjectSchedulingen
dc.subjectFlow shopen
dc.subjectShifting Bottleneck Heuristicen
dc.subjectMachine Based Decompositionen
dc.subjectJohnson’s Ruleen
dc.titleApplying machine-based decomposition in 2 machine flow shopsen
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Applyingmachine.pdf
  Restricted Access
248.9 kBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.