Abstract
Multistage hybrid flow shop scheduling problems are considered in this paper. Each stage consists of several identical machines. The jobs are to be processed on any one of the machines at each stage. In most of the scheduling research works it is assumed that all jobs are to be processed at all stages. But in real-life industries some of the jobs may not be processed at some stages. Hence hybrid flow shop scheduling problems with missing operations are considered in this paper with the objective of determining a schedule that minimises makespan. The hybrid flow shop scheduling problems are non-deterministic polynomial time hard (NP-hard) problems. We propose a hybrid meta-heuristic algorithm, namely improved hybrid genetic scatter search (IHGSS) algorithm, based on genetic algorithm and scatter search algorithms. A case study problem of a leading steel furniture manufacturing company in India is presented to illustrate the proposed algorithm. Computational experiments show that the proposed IHGSS algorithm outperforms other heuristic and meta-heuristic algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Industrial and Systems Engineering
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.