|1||PHILIP K. Due date quotation models and algorithms. Scheduling Algorithms Methods & Models, 2005, 11 (3): 187- 204.|
|2||TANG L, WANG G, LIU J. A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry. Elsevier, Computers & Operations Research, 2007, 34 (10): 3001- 3015.|
|3||CLAUDE D, DAWID S, BRETT H. Molten metal treatment improvements at JW aluminum used as a method to guarantee metal quality. Light Metals, 2015, 31 (6): 979- 982.|
|4||MICHAEL P. Single machine models with release dates (stochastic). Scheduling, 2016, 42 (3): 293- 317.|
|5||CHANG Z, SONG S, ZHANG Y, et al. Distributionally robust single machine scheduling with risk aversion. European Journal of Operational Research, 2017, 256 (1): 261- 274.|
|6||YU S, FRANK W. Sequencing and scheduling with inaccuratedata. New York: Nova Science Publishers, 2014.|
|7||ROMAN S, MACIEJ H. Scheduling under fuzziness. Physica-Verlag, 2000, 5 (1): 98- 99.|
|8||ADAM K, PAWE Z. Robust single machine scheduling problem with weighted number of late jobs criterion. Operations Research Proceedings, 2014, 279- 284.|
|9||MICHAEL D. Deterministic and stochastic scheduling. Proc. of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, 2012, 6 (2): 84- 92.|
|10||ZHANG L, LIN Y, XIAO Y, et al. International journal of machine learning and cybernetics. New York: Springer, 2017.|
|11||ANDREW D, CHRISTOPHE G, CHRIS B. Slack-based techniques for robust schedules. Proc. of the 6th European Conference on Planning, 2014, 115- 128.|
XIONG J, XING L, CHEN Y. Robust scheduling for multiobjective flexible job-shop problems with random machine breakdowns. International Journal of Production Economics, 2013, 141 (1): 112- 126.
|13||YUE F, SONG S, ZHANG Y, et al. Single machine scheduling with uncertain release times. Proc. of the 36th Control Conference, 2017, 2729- 2734.|
RICHARD D, PANAGIOTIS K. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, 1995, 41 (2): 363- 376.
|15||SOTSKOV Y N, LAI T C. Minimizing total weighted flow time under uncertainty using dominance and a stability box. Computers & Operations Research, 2012, 39 (6): 1271- 1289.|
|16||LAI D, CHYAN T, YU S, et al. The optimality box in uncertain data for minimising the sum of the weighted job completion times. International Journal of Production Research, 2017, 7 (5): 529- 557.|
|17||JORDI P. The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Computers & Operations Research, 2016, 66 (8): 141- 152.|
|18||MONALDO M, NIKOLAUS M, OLA S. Approximating single machine scheduling with scenarios, 2008, 40(3): 153-164.|
MOGHADDAM S, KAVEH A, SEYED S, et al. A scenario-based robust optimization approach for batch processing scheduling. Proc. of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2016, 230 (12): 2286- 2295.
CHRISTIAN B, JENS K. Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. European Journal of Operational Research, 2017, 261 (3): 835- 848.
XU X, CUI W, LIN J, et al. Robust makespan minimisation in identical parallel machine scheduling problem with interval data. International Journal of Production Research, 2013, 51 (12): 3532- 3548.
|22||NING C, YOU F. Adaptive robust optimization with minimax regret criterion: multiobjective optimization framework and computational algorithm for planning and scheduling under uncertainty. Computers & Chemical Engineering, 2017, 108 (5): 425- 447.|
|23||JAN L, RINNOOY K, PETER B. Complexity of machine scheduling problems. Journal of Scheduling, 1977, 1 (4): 343- 362.|
KENNETH B, ZAW S. Sequencing with due-dates and early start times to minimize maximum tardiness. Naval Research Logistics, 1974, 21 (1): 171- 176.
HOOGEVEEN J A, VAN DE VELDE S L. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. Informs Journal on Computing, 1996, 8 (4): 402- 412.
|26||GHAITH R, MANSOOREH M, GEORGIOS A. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence dependent setup time. Computers & Operations Research, 2004, 31 (10): 1727- 1751.|
|27||ASIYE A, HARUN A, ALI A. Minimising maximum tardiness in assembly flowshops with setup times. International Journal of Production Research, 2017, 16 (11): 25- 37.|
|28||PARISA A, BARZOKI R. Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Applied Soft Computing, 2016, 47 (6): 343- 356.|
|29||JAFARI A A, LOTFIM M. Single machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs. Scientia Iranica, 2018, 25 (1): 370- 385.|
MOHAMED A, CROCE D. Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 2008, 36 (3): 338- 342.
|31||IGOR A. Minmax regret solutions for minimax optimization problems with uncertainty. Operations Research Letters, 2000, 27 (2): 57- 65.|
|32||EHSAN A, MOSTAFA Z, MOJTABA F, et al. A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Computers & Operations Research, 2016, 73 (9): 56- 66.|
|33||WANG B, WANG X, LAN F, et al. A hybrid local search algorithm for robust job shop scheduling under scenarios. Applied Soft Computing, 2018, 62 (4): 259- 271.|
|34||NITISH U, ALAN E, MICHEL B. The robust single machine scheduling problem with uncertain release and processing times. Journal of Scheduling, 2014, 34 (15): 149- 163.|
|35||ARROYO JEC, OTTONI RDS, OLIVEIRAAD P. Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows. Electronic Notes in Theoretical Computer Science, 2011, 281 (1): 5- 19.|
|36||GUO P, CHEN W, WANG Y. A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. Journal of Industrial & Management Optimization, 2017, 10 (4): 1071- 1090.|
JOAQU P, SANTIAGO P, SILVIA C, et al. Variable neighborhood search with memory for a singlemachine scheduling problem with periodic maintenance and sequence-dependent set-up times. Journal of Scheduling, 2013, 16 (6): 661- 673.
|||Ruiyang LI, Ming HE, Hongyue HE, Zhixue WANG, Cheng YANG. A branch and price algorithm for the robust WSOS scheduling problem [J]. Journal of Systems Engineering and Electronics, 2021, 32(3): 658-667.|
|||Ke Wang, and Fajie Wei. Robust data envelopment analysis based MCDM with the consideration of uncertain data [J]. Journal of Systems Engineering and Electronics, 2010, 21(6): 981-989.|