Uncertain flexible flow shop scheduling problem subject to breakdowns

Flexible flow shop scheduling problems become more complex when uncertain factors are taken into consideration. Most literature are under the assumption that machines are continuous available. But, a machine can be unavailable for many reasons, such as breakdown and planned preventive maintenance. Once a machine breaks down, then the original schedule can not be executed and we must make the corresponding adjustment according to the actual situation. This paper deals with a flexible flow shop scheduling problem with uncertain processing and repair time subject to breakdowns. Machines are noncontinuously available, i.e., they break down at arbitrary time instance not known in advance. The problem with breakdowns is modeled as a series of problems without breakdowns. To solve the problem, approaches including genetic algorithm and particle swarm optimization are used in this paper. A numerical example shows the effectiveness of the proposed approach. 5

[1]  P. Asokan,et al.  A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2007, Int. J. Comput. Math..

[2]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[3]  Hua Ke,et al.  Uncertain random multilevel programming with application to production control problem , 2015, Soft Comput..

[4]  Yuanguo Zhu,et al.  Two empirical uncertain models for project scheduling problem , 2015, J. Oper. Res. Soc..

[5]  Ali Allahverdi,et al.  Two-machine ordered flowshop scheduling under random breakdowns , 1994 .

[6]  Baoding Liu,et al.  Theory and Practice of Uncertain Programming , 2003, Studies in Fuzziness and Soft Computing.

[7]  Ali Allahverdi,et al.  Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness , 1996, Comput. Oper. Res..

[8]  Kai Yao,et al.  Uncertain differential equation with jumps , 2015, Soft Comput..

[9]  Ali Allahverdi,et al.  Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns , 1995 .

[10]  Kai Yao,et al.  Continuous dependence theorems on solutions of uncertain differential equations , 2014 .

[11]  David Alcaide López de Pablo,et al.  An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns , 2002, Eur. J. Oper. Res..

[12]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[13]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[14]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .

[15]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[16]  Joaquín Sicilia,et al.  A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures , 2005 .

[17]  Susanne Albers,et al.  Scheduling with unexpected machine breakdowns , 2001, Discret. Appl. Math..

[18]  Yuanguo Zhu,et al.  OPTIMISTIC VALUE MODEL OF UNCERTAIN OPTIMAL CONTROL , 2013 .

[19]  Yuanguo Zhu,et al.  Bang-bang control model for uncertain switched systems , 2015 .

[20]  Anand Paul,et al.  Minimizing makespan on a single machine subject to random breakdowns , 2006, Oper. Res. Lett..

[21]  Ali Allahverdi,et al.  Dual criteria scheduling on a two-machine flowshop subject to random breakdowns , 1998 .

[22]  Ruhul A. Sarker,et al.  Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns , 2011 .

[23]  Wei Li,et al.  Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities , 1995, Oper. Res. Lett..