Service-oriented robust parallel machine scheduling

Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investig...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 57; H. 12; S. 3814 - 3830
Hauptverfasser: Liu, Ming, Liu, Xin, Chu, Feng, Zheng, Feifeng, Chu, Chengbin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 18.06.2019
Taylor & Francis LLC
Schlagworte:
ambiguous processing time
Computation
Computer Science
Covariance matrix
distributionally robust
Job shops
Mixed integer
Operations Research
Optimization
Probability theory
Production scheduling
Scheduling
service level
stochastic optimisation
Service level
Scheduling
Ambiguous processing time
Stochastic optimisation
Distributionally robust
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2018.1497311