Distributionally robust single machine scheduling with the total tardiness criterion

•A distributionally robust optimization (DRO) model is adopted to minimize the total tardiness criterion for machine scheduling.•An explicit expression is derived as an upper bound approximation for the robust objective.•Branch-and-bound and beam search algorithms are proposed to solve the problem.•...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 101; s. 13 - 28
Hlavní autori:	Niu, Shengsheng, Song, Shiji, Ding, Jian-Ya, Zhang, Yuli, Chiong, Raymond
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.01.2019 Pergamon Press Inc
Predmet:	Algorithms Beam search Branch-and-bound Computational mathematics Criteria Distributionally robust optimization Filtration Job shops Mixed integer Operations research Optimization Processing speed Random variables Robust control Robustness Scheduling Scheduling algorithms Search algorithms Single machine scheduling Stochastic models Total tardiness Upper bounds Branch-and-bound Beam search Single machine scheduling Total tardiness Distributionally robust optimization
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!