Abstract
This paper considers a scheduling problem of minimizing the maximum lateness for a parallel- machine flowshop with m stages, each of which consists of one or more identical parallel machines. We propose a heuristic algorithm being based on a shifting bottleneck approach which decomposes the parallel- machine flowshop problem into m parallel-machine scheduling problems to be solved one by one. Each parallel-machine problem is approximately solved by applying a property of its reversibility in the proposed heuristic. To evaluate performance of the proposed heuristic, it is numerically compared with Wittrock's algorithm for a real production line, and with Santos et al.'s global lower bound for test problem instances randomly generated. The results obtained strongly suggest that the proposed heuristic produces optimal or quite near optimal solutions within short computational time with high probability. 1. Introducton
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
