A note on reverse scheduling with maximum lateness objective

Li, S. S.; Brucker, Peter; Ng, C. T.; Cheng, T.C.E.; Shakhlevich, Natalia V.; Yuan, Jinjiang

doi:10.1007/s10951-013-0314-4

Cited by 7 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be discovered that there are many common characteristics between ISP and RSP (reverse scheduling problem). Besides, Li et al (2013) carried out research on RSP and discussed the natural properties of the reverse problem, establishing a reverse model with due dates and deadlines.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Mou

Gao

et al. 2015

J Intell Manuf

View full text Add to dashboard Cite

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.

show abstract

Section: Literature Reviewmentioning

confidence: 99%