Multi-objective inverse scheduling optimization of single-machine shop system with uncertain due-dates and processing times

Generally, ideal manufacturing system environments are assumed before determining effective scheduling. However, the original schedule is no longer optimal or even to be infeasible due to many uncertain events. This paper investigates a multi-objective inverse scheduling problem in single-machine sh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cluster computing 2017-03, Vol.20 (1), p.371-390
Hauptverfasser: Mou, Jianhui, Gao, Liang, Li, Xinyu, Pan, Quanke, Mu, Jiancai
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Generally, ideal manufacturing system environments are assumed before determining effective scheduling. However, the original schedule is no longer optimal or even to be infeasible due to many uncertain events. This paper investigates a multi-objective inverse scheduling problem in single-machine shop system with due-dates and uncertain processing parameters. Moreover, in order to more close the addressed problem into the situations encountered in real world, the processing parameters are considered to be uncertain stochastic parameters. First, a comprehensive mathematical model for multi-objective single-machine inverse scheduling problem (MSMISP) is addressed. Second, an effective hybrid multi-objective evolutionary algorithm (HMNL) is proposed to handle uncertain processing parameters (uncertainties) and multiple objectives at the same time. In HMNL, using an effective decimal system encoding scheme and genetic operators, the non-dominated sorting based on NSGA-II is adapted for the MSMISP. In addition, hybrid HMNL are proposed by incorporating an adaptive local search scheme into the well-known NSGA-II, where applies a separate local search process, total six strategies, to improve quality of solutions. Furthermore, an on-demand layered strategy is embedded into the elitism strategy to keep the population diversity. Afterwards, an external archive set is dynamically updated, where a non-dominated solution is selected to participate in the creation of the new population. Finally, 36 public problem instances with different scales and statistical performance comparisons are provided for the HMNL algorithm. This paper is the first to propose a mathematical model and develop a hybrid MOEA algorithm to solve MSMISP in inverse scheduling domain.
ISSN:1386-7857
1573-7543
DOI:10.1007/s10586-016-0717-z