Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times

V. Anjana (), R. Sridharan () and P. N. Ram Kumar ()
Additional contact information
V. Anjana: National Institute of Technology Calicut
R. Sridharan: National Institute of Technology Calicut
P. N. Ram Kumar: Indian Institute of Management Kozhikode

Journal of Scheduling, 2020, vol. 23, issue 1, No 3, 49-69

Abstract: Abstract Industries such as textiles, paints, chemicals, paper, drugs and pharmaceuticals operate as flow shops with sequence-dependent setup times (SDST). The sequence-dependent setup environment is characterised by the dependence of the setup time on the current job and also on the previous job processed on that machine. To further complicate the problem, in most real-life scenarios, decision-makers have to optimise more than one performance measure while scheduling jobs on machines. This work considers such a multi-objective SDST flow shop environment. The objectives considered in the present study are minimisation of makespan and minimisation of mean tardiness. Four metaheuristics, viz. non-dominated sorting genetic algorithm (NSGA) II, hybrid NSGA II, discrete particle swarm optimisation and hybrid discrete particle swarm optimisation, belonging to the category of intelligent optimisation techniques, are developed to obtain a set of Pareto-optimal solutions. The proposed metaheuristics are applied on benchmark SDST flow shop problems and their performance compared using different measures. Analysis of the results reveals that hybrid NSGA II outperforms the other three algorithms for all problem sizes considered in the present research. The results also indicate that hybridisation of the metaheuristics with variable neighbourhood search improves their performance.

Keywords: Permutation flow shop; Sequence-dependent setup time; NSGA II; Discrete particle swarm optimisation; Variable neighbourhood search (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00610-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:23:y:2020:i:1:d:10.1007_s10951-019-00610-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-019-00610-0

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().