Proportionate flow shop: New complexity results and models with due date assignment期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Proportionate flow shop: New complexity results and models with due date assignment

Authors:	SS Panwalkar Christos Koulamas

Affiliation:	1. Carey Business School, Johns Hopkins University, Baltimore, Maryland;2. Department of Decision Sciences and Information Systems, Florida International University, Miami, Florida

Abstract:	It is known that the proportionate flow shop minimum makespan $F m / p r p t / C_{\max}$ problem is solved optimally by any permutation job sequence. We show that the $F m / p r p t / C_{\max}$ problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases. We then consider the standard proportionate flow shop problem (with no missing operations) and show that the solution algorithms for a class of single‐machine due date assignment problems can be extended/generalized to the corresponding proportionate flow shop problems. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 98–106, 2015

Keywords:	flow shop missing operations due date determination