Abstract
Scope and Purpose—A permutation flowshop consists of serial machines that process a given number of jobs in the same order. In this permutation flowshop, a sequence of jobs that optimizes performance measures such as makespan and mean flowtime should be determined. These scheduling problems are known as the NP-complete problem in the area of combinatorial optimization. The purpose of this paper is to develop a heuristic algorithm by modifying the characteristics in the existing algorithms known as good heuristics, and to show improvement with respect to mean flowtime. Based on a job insertion method, a heuristic algorithm is developed to reduce the mean flowtime in a permutation flowshop environment. Simulation experiments are performed to evaluate effectiveness of the proposed algorithm against the existing heuristic methods. The simulation results show that the proposed algorithm generates more accurate solutions than other heuristics, especially when ratio of the number of jobs and the number of machines is greater than or equal to two.
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.
