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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
