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.•...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 101; pp. 13 - 28
Main Authors:	Niu, Shengsheng, Song, Shiji, Ding, Jian-Ya, Zhang, Yuli, Chiong, Raymond
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.01.2019 Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!