Counterexamples to optimal permutation schedules for certain flow shop problems

S. S. Panwalkar, M. L. Smith and C. R. Woollam

Naval Research Logistics Quarterly, 1981, vol. 28, issue 2, 339-340

Abstract: It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800280215

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:28:y:1981:i:2:p:339-340

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().