Abstract
Abstract Algorithms have been presented in the literature to find the optimal sequencing of jobs for a two-machine flow shop. We extend the results to a labor limited situation where only a single server is available and switching times are involved in moving the worker from one machine to the other. We present the theoretical results needed for the development of the algorithm, the algorithm, and an example problem solved using the algorithm.
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.
