Single-Server, Two-Machine Sequencing with Switching Time

Vinod K. Sahney
Additional contact information
Vinod K. Sahney: Wayne State University, Detroit, Michigan

Operations Research, 1972, vol. 20, issue 1, 24-36

Abstract: In sequencing problems, one of the major assumptions made is that labor is available to operate each of the machines in the shop. In many real-life situations, this assumption is not realistic; labor usually acts as a limiting resource, together with the machines. In this paper we discuss the sequencing of jobs on two machines in parallel when only a single server is available and a finite switching time is incurred to move the server from one machine to the other, and describe an algorithm to solve this problem.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.24 (application/pdf)

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:inm:oropre:v:20:y:1972:i:1:p:24-36

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().