Next Article in Journal
Characteristics of Particulate Pollution (PM2.5 and PM10) and Their Spacescale-Dependent Relationships with Meteorological Elements in China
Previous Article in Journal
Measuring Crowdedness between Adjacent Stations in an Urban Metro System: a Chinese Case Study
Article Menu
Issue 12 (December) cover image

Export Article

Open AccessArticle
Sustainability 2017, 9(12), 2318; https://doi.org/10.3390/su9122318

A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion

1
School of Information and Science Technology, Northeast Normal University, Changchun 130117, China
2
Department of Computer Science, College of Humanities & Sciences of Northeast Normal University, Changchun 130117, China
*
Authors to whom correspondence should be addressed.
Received: 25 October 2017 / Revised: 7 December 2017 / Accepted: 9 December 2017 / Published: 14 December 2017
View Full-Text   |   Download PDF [1028 KB, uploaded 14 December 2017]   |  

Abstract

This paper focuses on the flowshop scheduling problem with sequence dependent setup times (FSSP-SDST), which has been an investigated object for decades as one of the most popular scheduling problems in manufacturing systems. A novel hybrid local search algorithm called HLS is presented to solve the flowshop scheduling problem with sequence dependent setup times with the criterion of minimizing the makespan. Firstly, the population is initialized by the Nawaz-Enscore-Hoam based problem-specific method (NEHBPS) to generate high quality individuals of the current population. Then, a global search embedded with a light perturbation is designed to produce a new population. After that, to improve the quality of individuals in the current population, a single insertion-based local search is applied. Meanwhile, a further local search strategy based on the insertion-based local search is used to find better solutions for the individuals which are non-improved. Finally, the heavy perturbation is used to explore potential solutions in the neighbor region. To validate the performance of HLS, we compare our proposed algorithm with other competitive algorithms on Taillard benchmark problems. From the experimental results, it can be concluded that the proposed algorithm outperforms the benchmark algorithms. View Full-Text
Keywords: optimal scheduling; sequence dependent setup times; local search; makespan optimal scheduling; sequence dependent setup times; local search; makespan
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wang, Y.; Li, X.; Ma, Z. A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion. Sustainability 2017, 9, 2318.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sustainability EISSN 2071-1050 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top