A parallel-machine scheduling with periodic constraints under uncertainty

Most studies on scheduling problem have assumed that the machine is continuously available. However, the machine is likely to be unavailable for many practical reasons (e.g. breakdown and planned preventive maintenance). Once a machine is not available, the optimal scheme in the deterministic scenario may not be the optimal choice. To address the actual scenario, a scheduling problem with two identical parallel machines, one of which requires periodic maintenance, is considered in this article. For uncertainties in reality, the processing and maintenance time are considered as uncertain variables. A novel method to study the worst-case ratio in an uncertain scenario is proposed. It is shown that the worst-case ratio of the longest processing time algorithm is 3/2 at a high confidence level. Given theoretical analysis results, an modified algorithm is proposed. Finally, numerical experiments are used to verify the feasibility of the modified algorithm.

[1]  Kai Zhu,et al.  An uncertain single machine scheduling problem with periodic maintenance , 2017, Knowl. Based Syst..

[2]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[3]  Yin-Feng Xu,et al.  Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint , 2011, Theor. Comput. Sci..

[4]  Gilbert Laporte,et al.  Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times , 2018, Eur. J. Oper. Res..

[5]  Baoding Liu.  Some Research Problems in Uncertainty Theory , 2009 .

[6]  Jose M. Framiñan,et al.  Single machine scheduling with periodic machine availability , 2018, Comput. Ind. Eng..

[7]  Yuhan Liu,et al.  Risk Index in Uncertain Random Risk Analysis , 2014, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[8]  Klaus Jansen,et al.  Approximation Algorithms for Scheduling with Reservations , 2007, Algorithmica.

[9]  Fan Chung Graham,et al.  Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions , 2016, OR Spectr..

[10]  Christos Koulamas,et al.  The proportionate two-machine no-wait job shop scheduling problem , 2016, Eur. J. Oper. Res..

[11]  Yuanguo Zhu.  Functions of Uncertain Variables and Uncertain Programming , 2012 .

[12]  Shuping Yi,et al.  A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan , 2017 .

[13]  Yuanguo Zhu,et al.  Bang-bang control model for uncertain switched systems , 2015 .

[14]  Qing Cui,et al.  Uncertain Programming Model for Solid Transportation Problem , 2012 .

[15]  Christos Koulamas,et al.  A modified LPT algorithm for the two uniform parallel machine makespan minimization problem , 2009, Eur. J. Oper. Res..

[16]  Kangbok Lee,et al.  The effect of machine availability on the worst-case performance of LPT , 2005, Discret. Appl. Math..

[17]  Dvir Shabtay,et al.  Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times , 2017, Eur. J. Oper. Res..

[18]  Joaquín A. Pacheco,et al.  Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times , 2018, Knowl. Based Syst..

[19]  Xingfang Zhang,et al.  A New Uncertain Programming Model for Project Scheduling Problem , 2011 .

[20]  Li-xia Rong.  Two New Uncertainty Programming Models of Inventory with Uncertain Costs , 2011 .

[21]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[22]  Annamária Kovács,et al.  Tighter approximation bounds for LPT scheduling in two special cases , 2006, J. Discrete Algorithms.

[23]  Bo Zhang,et al.  Covering location problem of emergency service facilities in an uncertain environment , 2017 .

[24]  Honggang Wang,et al.  Dynamic scheduling and analysis of real time systems with multiprocessors , 2016 .

[25]  Ting Wang,et al.  A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine , 2018, Eur. J. Oper. Res..

[26]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[27]  W. J. Chen,et al.  Single-machine scheduling with periodic maintenance and nonresumable jobs , 2003, Comput. Oper. Res..

[28]  T.C.E. Cheng,et al.  A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint , 2015 .

[29]  Christos Koulamas,et al.  An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines , 2008, Eur. J. Oper. Res..

[30]  Zixiong Peng,et al.  An uncertain programming for empty container allocation , 2011 .

[31]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[32]  Suresh P. Sethi,et al.  Parallel-machine scheduling with machine-dependent maintenance periodic recycles , 2017 .

[33]  Dehua Xu,et al.  Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline Version , 2009, 2010 Third International Joint Conference on Computational Science and Optimization.

[34]  Rong Gao,et al.  FURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES , 2018 .