An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems

Jianhui Mou, Xinyu Li, Liang Gao () and Wenchao Yi
Additional contact information
Jianhui Mou: Huazhong University of Science and Technology
Xinyu Li: Huazhong University of Science and Technology
Liang Gao: Huazhong University of Science and Technology
Wenchao Yi: Huazhong University of Science and Technology

Journal of Intelligent Manufacturing, 2018, vol. 29, issue 4, No 4, 789-807

Abstract: Abstract Generally, in handling traditional scheduling problems, ideal manufacturing system environments are assumed before determining effective scheduling. Unfortunately, “ideal environments” are not always possible. Real systems often encounter some uncertainties which will change the status of manufacturing systems. These may cause the original schedule to no longer to be optimal or even feasible. Traditional scheduling methods are not effective in coping with these cases. Therefore, a new scheduling strategy called “inverse scheduling” has been proposed to handle these problems. To the best of our knowledge, this research is the first to provide a comprehensive mathematical model for multi-objective permutation flow-shop inverse scheduling problem (PFISP). In this paper, first, a PFISP mathematical model is devised and an effective hybrid multi-objective evolutionary algorithm is proposed to handle uncertain processing parameters (uncertainties) and multiple objectives at the same time. In the proposed algorithm, we take an insert method NEH-based (Nawaz–Enscore–Ham) as a local improving procedure and propose several adaptations including efficient initialization, decimal system encoding, elitism and population diversity. Finally, 119 public problem instances with different scales and statistical performance comparisons are provided for the proposed algorithm. The results show that the proposed algorithm performs better than the traditional multi-objective evolution algorithm (MOEA) in terms of searching quality, diversity level and efficiency. This paper is the first to propose a mathematical model and develop a hybrid MOEA algorithm to solve PFISP in inverse scheduling domain.

Keywords: Inverse scheduling; Flow-shop scheduling; Multi-objective evolution algorithm; Local improving strategy; Hybrid algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10845-015-1129-2 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:joinma:v:29:y:2018:i:4:d:10.1007_s10845-015-1129-2

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

DOI: 10.1007/s10845-015-1129-2

Access Statistics for this article

Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak

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