Towards robustness of response times: minimising the maximum inter-completion time on parallel machines

Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as possible without preempting any in-processing jobs, this paper considers a deterministic identical parallel machine scheduling problem to achieve robustness with regard to a worst-case response time. To the best of our knowledge, this paper is the first to study the objective of minimising the maximum inter-completion time, i.e. the maximum time difference between any two consecutive completion times of jobs. For this novel scheduling problem, we first show its NP-hardness, and then propose an integer linear programming formulation and three heuristic approaches. Numerical experiments demonstrate the efficiency of our solution methods.

[1]  Gur Mosheiov,et al.  Simultaneous minimization of total completion time and total deviation of job completion times , 2004, Eur. J. Oper. Res..

[2]  Gur Mosheiov,et al.  Scheduling a maintenance activity on parallel identical machines , 2009 .

[3]  T. C. Edwin Cheng,et al.  Rescheduling on identical parallel machines with machine disruptions to minimize total completion time , 2016, Eur. J. Oper. Res..

[4]  Jianyu Long,et al.  Dynamic scheduling in steelmaking-continuous casting production for continuous caster breakdown , 2017, Int. J. Prod. Res..

[5]  M. Azizoglu,et al.  Generating all efficient solutions of a rescheduling problem on unrelated parallel machines , 2009 .

[6]  Ghaith Rabadi,et al.  Rescheduling of unrelated parallel machines under machine breakdowns , 2008 .

[7]  Daniel Oron,et al.  Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times , 2008, Comput. Oper. Res..

[8]  Gur Mosheiov,et al.  A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop , 2015 .

[9]  Meral Azizoglu,et al.  Parallel-machine rescheduling with machine disruptions , 2005 .

[10]  Hui-Mei Wang,et al.  Minimizing total absolute deviation of job completion times on a single machine with cleaning activities , 2017, Comput. Ind. Eng..

[11]  Linyan Sun,et al.  Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times , 2009 .

[12]  Mohamed Eid Hussein,et al.  IDENTICAL PARALLEL MACHINES , 2019 .

[13]  Rui Feng Shi,et al.  Rescheduling of Parallel Machines under Machine Failures , 2012 .

[14]  M Özlen,et al.  Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria , 2011, J. Oper. Res. Soc..

[15]  Hong Zhou,et al.  On the identical parallel-machine rescheduling with job rework disruption , 2013, Comput. Ind. Eng..

[16]  Sinan Gürel,et al.  Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives , 2015 .

[17]  Gur Mosheiov,et al.  Total absolute deviation of job completion times on uniform and unrelated machines , 2011, Comput. Oper. Res..

[18]  Fuh-Der Chou,et al.  Minimizing makespan subject to minimum total absolute deviation of completion time on identical parallel machines , 2012 .

[19]  B. Srirangacharyulu,et al.  Minimising mean squared deviation of job completion times about a common due date in multimachine systems , 2011 .