On the parameterized tractability of single machine scheduling with rejection

Abstract In this paper we study a single machine scheduling problem with rejection. In such a scheduling problem, the scheduler can reject to process a job in the shop at a certain cost. Our objective is to minimize the total completion time of the jobs to be processed in the shop, given that the total rejection cost will not exceed a certain predefined threshold. The problem is known to be NP-hard, and to better investigate its hardness our objective is to study whether the problem becomes tractable when some specific natural parameters are of a limited size. The analysis is done by using the theory of parameterized complexity and includes the following parameters: the cardinality of the set of accepted jobs, the number of different processing times, the number of different rejection costs, the maximal processing time, and the maximal rejection cost. We show that the problem is W[1]-hard for the first parameter, while it is fixed-parameterized tractable for all other parameters.

[1]  Dvir Shabtay,et al.  A bicriteria approach to scheduling a single machine with job rejection and positional penalties , 2012, J. Comb. Optim..

[2]  Robert Weismantel,et al.  Integer convex minimization by mixed integer linear optimization , 2014, Oper. Res. Lett..

[3]  Rolf Niedermeier,et al.  Interval scheduling and colorful independent sets , 2012, J. Sched..

[4]  Rolf Niedermeier,et al.  A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack , 2015, Journal of Scheduling.

[5]  Dvir Shabtay,et al.  New algorithms for minimizing the weighted number of tardy jobs on a single machine , 2017, Annals of Operations Research.

[6]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[7]  Santosh S. Vempala,et al.  Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  Jinjiang Yuan,et al.  Single-machine scheduling under the job rejection constraint , 2010, Theor. Comput. Sci..

[9]  Matthias Mnich,et al.  Scheduling and fixed-parameter tractability , 2015, Math. Program..

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

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

[12]  Dvir Shabtay,et al.  A survey on offline scheduling with rejection , 2013, J. Sched..

[13]  Martin Koutecký,et al.  Scheduling meets n-fold integer programming , 2016, J. Sched..

[14]  René van Bevern,et al.  Parameterized complexity of machine scheduling: 15 open problems , 2017, Comput. Oper. Res..

[15]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[16]  Piotr Faliszewski,et al.  Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting , 2020, Theor. Comput. Sci..