Abstract
AbstractThe paper is concerned with algorithms for the two-machine flow shop, where each job needs storage space (a buffer) during the entire time of its processing. The buffer requirement is determined by the duration of job’s first operation. The goal is to minimise the time needed for the completion of all jobs. This scheduling problem is NP-hard in the strong sense. Recently, the polynomial-time algorithms were developed for particular cases of this problem. In this paper, we discuss two heuristics based on these polynomial-time algorithms and compare them with other efficient heuristics.KeywordsFlow shopBufferMakespanHeuristics
Sign-in/Register to access full text options 
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.
