Abstract
This paper addresses a heuristic algorithm that minimizes total weighted tardiness for reentrant flow shop problems with sequence-dependent set up time. The proposed algorithm consists of three phases: prior plan phase, initial solution generation phase and solution improvement phase. In the first phase, a reentrant order with cyclic process is divided into a number of jobs. An initial solution is obtained by a RATCS (revised apparent tardiness cost with setups) rule in the second phase, and the last phase employs a RHTS (rolling horizon tabu search) to improve the solution. The experimental results show that the proposed algorithms give very efficient schedules in terms of total weighted tardiness and computational effort.
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: The International Journal of Advanced Manufacturing Technology
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.
