View article

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 …