Robust single machine scheduling problem with uncertain job due dates for industrial mass production  

作　　者：YUE Fan SONG Shiji JIA Peng WU Guangping ZHAO Han 

机构地区：[1]Department of Automation,Tsinghua University,Beijing 100084,China [2]Research Institute of Systems Engineering,Beijing 100072,China [3]Jiuquan Satellite Launch Centre,Jiuquan 735000,China [4]Department of Basic Science,Army Logistics Academy,Chongqing 401311,China

出　　处：《Journal of Systems Engineering and Electronics》2020年第2期350-358,共9页系统工程与电子技术（英文版）

基　　金：supported by the National Natural Science Foundation of China(61503211,U1660202)。

摘　　要：The single machine scheduling problem which involves uncertain job due dates is one of the most important issues in the real make-to-order environment. To deal with the uncertainty, this paper establishes a robust optimization model by minimizing the maximum tardiness in the worst case scenario over all jobs. Unlike the traditional stochastic programming model which requires exact distributions, our model only needs the information of due date intervals. The worst case scenario for a given sequence that belongs to a set containing only n scenarios is proved, where n is the number of jobs. Then, the model is simplified and reformulated as an equivalent mixed 0-1 integer linear programming(MILP) problem. To solve the MILP problems efficiently, a heuristic approach is proposed based on a robust dominance rule. The experimental results show that the proposed method has the advantages of robustness and high calculating efficiency, and it is feasible for large-scale problems.

关 键 词：ROBUST optimization single machine scheduling maximum TARDINESS UNCERTAIN DUE DATE 

分 类 号：F273[经济管理—企业管理]