Abstract
We examine a flow shop scheduling problem with overlapping waiting time constraints. The problem we consider is known to be NP-hard, and hence a mathematical optimization approach cannot solve large-sized instances within a reasonable computation time. Therefore, we propose a heuristic scheduling method using a genetic algorithm with local search. It is experimentally shown that the proposed algorithm is efficient and provides near-optimal solutions.
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 Korean Institute of Industrial Engineers
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.
