Abstract
This paper deals with a general continuous or no-wait manufacturing scheduling problem. Due to its applications in advanced manufacturing systems, no-wait scheduling has gained much attention in both practical and academic fields. Due to its NP-hard nature, most of the contributions focus on development of approximation based optimization methods or heuristics for the problem. Several heuristic procedures have been developed to solve this problem. This paper presents a survey of various methodologies developed to solve no-wait flow shop scheduling problem with the objective of minimizing single performance measure
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.
