Optimal flowshop schedules with no intermediate storage space

Jatinder N. D. Gupta

Naval Research Logistics Quarterly, 1976, vol. 23, issue 2, 235-243

Abstract: In this paper the problem of finding an optimal schedule for the n‐job, M‐machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed.

Date: 1976
References: Add references at CitEc
Citations:

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

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:23:y:1976:i:2:p:235-243

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