Two-agent scheduling with generalized due dates

Abstract In this paper we consider the problems of order pickers in warehouse management. We interpret the problems as machine scheduling problems in which the due dates are not specified for the jobs but for their positions. In addition, we also consider the situation where there exist two types of orders: the primary (or urgent) order and the secondary (regular) order. These problems can be modeled as two-agent scheduling problems with generalized due dates. In particular we consider two environments: single-machine and the proportionate flow shop. Two objectives are considered: The first objective is to minimize one agent's performance measure with a constraint on the other agent's one, while the second objective is to minimize the weighted sum of the performance measures of two agents. The performance measures introduced in this paper are the maximum tardiness, the total tardiness, and the total number of tardy jobs. We show that under both machine environments, the case with the first objective is weakly NP-hard when the performance measures of two agents are the total tardiness, while the other cases are polynomially solvable.

[1]  Shi-Sheng Li,et al.  Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs , 2018 .

[2]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..

[3]  Gur Mosheiov,et al.  Single machine just‐in‐time scheduling problems with two competing agents , 2014 .

[4]  Dario Pacino,et al.  Data for: Flexible ship loading problem with transfer vehicle assignment and scheduling , 2018 .

[5]  Chelliah Sriskandarajah.  A Note on the Generalized Due Dates Scheduling Problems , 1988 .

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

[7]  Gur Mosheiov,et al.  A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance , 2016, Journal of Combinatorial Optimization.

[8]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

[9]  T. C. Edwin Cheng,et al.  A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..

[10]  Nicholas G. Hall.  Scheduling Problems With Generalized Due Dates , 1986 .

[11]  Chelliah Sriskandarajah,et al.  On the Complexity of Generalized Due Date Scheduling Problems , 1991 .

[12]  Yuan Gao,et al.  Unary NP-hardness of minimizing total weighted tardiness with generalized due dates , 2016, Oper. Res. Lett..

[13]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[14]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[15]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[16]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[17]  Byung-Cheon Choi,et al.  Two-agent single-machine scheduling problem with just-in-time jobs , 2014, Theor. Comput. Sci..

[18]  T. C. Edwin Cheng,et al.  Two-agent scheduling to minimize the total cost , 2011, Eur. J. Oper. Res..