Parameterized Multi-Scenario Single-Machine Scheduling Problems

We study a class of multi-scenario single-machine scheduling problems. In this class of problems, we are given a set of scenarios with each one having a different realization of job characteristics. We consider these multi-scenario problems where the scheduling criterion can be any one of the following three: The total weighted completion time, the weighted number of tardy jobs, and the weighted number of jobs completed exactly at their due-date. As all the resulting problems are NP-hard, our analysis focuses on whether any one of the problems becomes tractable when some specific natural parameters are of limited size. The analysis includes the following parameters: The number of jobs with scenario-dependent processing times, the number of jobs with scenario-dependent weights, and the number of different due-dates.

[1]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[2]  Ming Zhao,et al.  A family of inequalities valid for the robust single machine scheduling polyhedron , 2010, Comput. Oper. Res..

[3]  Yuri N. Sotskov,et al.  Sequencing and Scheduling with Inaccurate Data , 2014 .

[4]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[5]  Mohamed Ali Aloulou,et al.  Minimizing the number of late jobs on a single machine under due date uncertainty , 2011, J. Sched..

[6]  Hussein Naseraldin,et al.  An approximation scheme for the bi-scenario sum of completion times trade-off problem , 2018, J. Sched..

[7]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[8]  Ola Svensson,et al.  Single machine scheduling with scenarios , 2013, Theor. Comput. Sci..

[9]  Adam Kasperski,et al.  Single machine scheduling problems with uncertain parameters and the OWA criterion , 2014, Journal of Scheduling.

[10]  Michael Pinedo,et al.  Scheduling stochastic jobs with due dates on parallel machines , 1990 .

[11]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[12]  Chung-Cheng Lu,et al.  Robust scheduling on a single machine to minimize total flow time , 2012, Comput. Oper. Res..

[13]  Jian Yang,et al.  On the Robust Single Machine Scheduling Problem , 2002, J. Comb. Optim..

[14]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  George L. Vairaktarakis,et al.  Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .

[17]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[18]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[19]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[20]  Peter Brucker,et al.  Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs , 2006, J. Math. Model. Algorithms.

[21]  Martin Skutella,et al.  Unrelated Machine Scheduling with Stochastic Processing Times , 2016, Math. Oper. Res..

[22]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[23]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[24]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[25]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[26]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

[27]  K. Glazebrook.  Scheduling tasks with exponential service times on parallel processors , 1979 .

[28]  P. Zieliński,et al.  MINMAX (REGRET) SCHEDULING PROBLEMS , 2013 .

[29]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[30]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[31]  Thomas Kämpke,et al.  Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors , 1989, Oper. Res..

[32]  Jon M. Peha,et al.  Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time , 1995, Comput. Oper. Res..

[33]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[34]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[35]  Federico Della Croce,et al.  Complexity of single machine scheduling problems under scenario-based uncertainty , 2008, Oper. Res. Lett..

[36]  Dvir Shabtay,et al.  Multi-scenario scheduling to maximise the weighted number of just-in-time jobs , 2019, J. Oper. Res. Soc..

[37]  Xiaoqing Xu,et al.  Robust makespan minimisation in identical parallel machine scheduling problem with interval data , 2013 .

[38]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[39]  Adam Kasperski,et al.  Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion , 2014, OR.