Flowshop/no‐idle or no‐wait scheduling to minimize the sum of completion times

I. Adiri and D. Pohoryles

Naval Research Logistics Quarterly, 1982, vol. 29, issue 3, 495-504

Abstract: This paper deals with flowshop/sum of completion times scheduling problems, working under a “no‐idle” or a “no‐wait” constraint, the former prescribes for the machines to work continuously without idle intervals and the latter for the jobs to be processed continuously without waiting times between consecutive machines. Under either of the constraints the problem is unary NP‐Complete for two machines. We prove some properties of the optimal schedule for n/2/F, no‐idle/σCi. For n/m/P, no‐idle/σCi, and n/m/P, no‐wait/σCi, with an increasing or decreasing series of dominating machines, we prove theorems that are the basis for polynomial bounded algorithms. All theorems are demonstrated numerically.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (6)

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

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:29:y:1982:i:3:p:495-504

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 ().