Distributionally robust single machine scheduling with the total tardiness criterion. (January 2019)

• Record Type: Journal Article
• Authors: Niu, Shengsheng; Song, Shiji; Ding, Jian-Ya; Zhang, Yuli; Chiong, Raymond
• Is Part Of: Computers & operations research. Volume 101(2019)
• Page Start: 13
• Page End: 28
• Publication Date: 2019-01
• Subjects: Single machine scheduling -- Distributionally robust optimization -- Total tardiness -- Branch-and-bound -- Beam search; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2018.08.007
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: 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. Experimental results confirm the efficacy of the proposed algorithms. Simulation experiments verify the effectiveness of the proposed DRO model. Abstract: This paper proposes a distributionally robust optimization (DRO) model for single machine scheduling with uncertain processing times. The processing time of each job is assumed to be an unknown random variable within a given distributional set, which is described by mean and variance information. The proposed DRO model aims to find an optimal sequence that minimizes the expected worst-case total tardiness. To the best of our knowledge, it is the first time in the relevant literature that a DRO approach 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, and then we transform the DRO problem into a mixed integer second-order cone programming problem. To solve this problem, a branch-and-bound algorithm with several novel bounding procedures and dominance rules is designed. Computational experiments confirm that the bounding procedures and dominance rules contribute significantly to the algorithm's efficiency, and problem instances with up to 30 jobs can be optimally solved within 40 s. To tackle large-scale problem instances, we further design a beam search algorithm with filtering and recovering phases. Additional experiments with instances beyond 30 jobs confirm the efficacy of this beam search algorithm. To test the effectiveness of the proposed DRO model, we compare the robust sequences to nominal sequences under different processing time distributions. Experimental results show that the robust sequences perform better than nominal sequences, especially when the due dates are relatively loose.