On equivalence between the proportionate flow shop and single‐machine scheduling problems. (27th October 2015)

• Record Type: Journal Article
• Authors: Panwalkar, S.S.; Koulamas, Christos
• Is Part Of: Naval research logistics. Volume 62:Number 7(2015:Oct.)
• Page Start: 595
• Page End: 603
• Publication Date: 2015-10-27
• Subjects: flow shop -- proportionate -- single‐machine; Logistics, Naval -- Periodicals; Supplies and stores -- Periodicals; 359.07
• DOI: 10.1002/nav.21666
• Languages: English
• ISSNs: 0894-069X

Abstract

Abstract: We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015