On equivalence between the proportionate flow shop and single‐machine scheduling problems |
| |
| Authors: | SS Panwalkar Christos Koulamas |
| |
| Institution: | 1. Carey Business School, Johns Hopkins University, Baltimore, Maryland;2. Department of Decision Sciences and Information Systems, Florida International University, Miami, Florida |
| |
| 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 |
| |
| Keywords: | flow shop proportionate single‐machine |
|
|
