Single-Server, Two-Machine Sequencing with Switching Time

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.