Robust single machine scheduling with external-party jobs

Abstract In this paper we address a problem arising in a manufacturing environment in which the owner of a machining resource, besides its own jobs, must process also jobs belonging to an external party. Due to contract commitments, the jobs of the external party must be processed within a certain due date, that can be considered as a deadline. Moreover, these jobs have a given release date corresponding to their actual availability in the manufacturing system. The external party jobs arrive with an estimate of their durations and the owner of the machining resource, when planning the schedule of its jobs, must take into account possible deviations from the nominal values of the external processing times. It is therefore important to determine a schedule which is robust to any possible changes in the durations of the external jobs. We consider the total completion time objective for the owner of the machining resource. However, due to the uncertainty on the external jobs processing times, we seek for a solution minimizing the maximum absolute deviation from an optimal schedule. We derive some properties of such robust schedules and evaluate the performance two mixed integer linear programming formulations.

[1]  Jordi Pereira,et al.  The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective , 2016, Comput. Oper. Res..

[2]  Eduardo Conde,et al.  A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines , 2014, Optim. Lett..

[3]  Adam Kasperski,et al.  An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..

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

[5]  D. Yang,et al.  Single machine total completion time scheduling problem with workload-dependent maintenance duration , 2015 .

[6]  Yong Chen,et al.  Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time , 2013, Inf. Sci..

[7]  Jian-Bo Yang,et al.  Minimizing total completion time on a single machine with a flexible maintenance activity , 2011, Comput. Oper. Res..

[8]  Igor Averbakh,et al.  Complexity of minimizing the total flow time with interval data and minmax regret criterion , 2006, Discret. Appl. Math..

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

[10]  Roberto Montemanni,et al.  A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data , 2007, J. Math. Model. Algorithms.

[11]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[12]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[13]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.