Single-Server, Two-Machine Sequencing with Switching Time
- 1 February 1972
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 20 (1) , 24-36
- https://doi.org/10.1287/opre.20.1.24
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.Keywords
This publication has 0 references indexed in Scilit: