Abstract
This paper proposes an extension of the mixed no-wait flowshop scheduling problem (MNFSP) which considers sequence-dependent setup times (SDSTs). A mixed integer linear programming model is presented to solve small problems with respect to the makespan criterion. Due to the strong NP-hardness of the research problem, an effective and efficient metaheuristic, called pairwise iterated greedy (PIG) algorithm, is proposed to solve medium- and large-size problems. Extensive computational results reveal that the proposed PIG algorithm significantly outperforms the compared algorithm under the same limited computational time. Since MNFSP with SDSTs is widely used in modern manufacturing systems, this innovative research will help to narrow the gap between scheduling theory and practical applications.
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.
