Parallel machine scheduling with limited controllable machine availability

Most machine scheduling models assume that either the machines are available all the time, or the time of their unavailability is fixed as a constraint. In this paper, we study the problem that neither the unavailability length nor the start time of machine unavailability is fixed. Instead, they would be determined in order to minimise the total cost involved with the completion time and the unavailable time. This model could represent a more realistic and complex situation, in which jobs and machines’ availability operations should be optimised simultaneously. After the model is formulated, some properties of the problem are presented. Then a branch and bound algorithm based on column generation approach is proposed to solve the problem. The computation results show that, within a reasonable computation time, the proposed algorithm can solve medium sized problems optimally.

[1]  Dehua Xu,et al.  Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline Version , 2009, 2010 Third International Joint Conference on Computational Science and Optimization.

[2]  Jen-Shiang Chen,et al.  Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan , 2008, Eur. J. Oper. Res..

[3]  Zhi-Long Chen,et al.  Simultaneous Job Scheduling and Resource Allocation on Parallel Machines , 2004, Ann. Oper. Res..

[4]  Hyun Joon Shin,et al.  An adaptive scheduling algorithm for a parallel machine problem with rework processes , 2010 .

[5]  Xiangtong Qi,et al.  Scheduling the maintenance on a single machine , 1999, J. Oper. Res. Soc..

[6]  T. C. Edwin Cheng,et al.  Heuristics for two-machine flowshop scheduling with setup times and an availability constraint , 2007, Comput. Oper. Res..

[7]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[8]  Ming Li,et al.  Asymptotic Identity in Min-Plus Algebra: A Report on CPNS , 2011, Comput. Math. Methods Medicine.

[9]  Lionel Amodeo,et al.  Bi-objective optimization algorithms for joint production and maintenance scheduling: application to the parallel machine problem , 2009, J. Intell. Manuf..

[10]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[11]  Ming Li,et al.  Visiting Power Laws in Cyber-Physical Networking Systems , 2012 .

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

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

[15]  Samir Lamouri,et al.  Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan , 2008 .

[16]  C.-H. Lin,et al.  Minimizing makespan for two parallel machines with job limit on each availability interval , 2007, J. Oper. Res. Soc..

[17]  Marie-Claude Portmann,et al.  Flow shop scheduling problem with limited machine availability: A heuristic approach , 2003 .

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

[19]  Ming Li,et al.  Representation of a Stochastic Traffic Bound , 2010, IEEE Transactions on Parallel and Distributed Systems.

[20]  Subbarao Kambhampati,et al.  Planning and Scheduling , 1997, The Computer Science and Engineering Handbook.

[21]  Melih Özlen,et al.  Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs , 2010 .

[22]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[23]  Ji-Bo Wang,et al.  Single machine scheduling problems with controllable processing times and total absolute differences penalties , 2005, Eur. J. Oper. Res..

[24]  Haiyan Wang,et al.  A new hybrid parallel algorithm for consistent-sized batch splitting job shop scheduling on alternative machines with forbidden intervals , 2010 .

[25]  M. Azizoglu,et al.  Single machine scheduling with preventive maintenances , 2009 .

[26]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..

[27]  Oliver Braun,et al.  Stability of Johnson's schedule with respect to limited machine availability , 2002 .

[28]  Maher Rebai,et al.  Scheduling jobs and maintenance activities on parallel machines , 2013, Oper. Res..

[29]  Lu-Wen Liao,et al.  Optimal parallel machines scheduling with machine availability and eligibility constraints , 2006 .