An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time

In this article the scheduling problem of dynamic hybrid flow shop with uncertain processing time is investigated and an ant colony algorithm based rescheduling approach is proposed. In order to reduce the rescheduling frequency the concept of due date deviation is introduced, according to which a rolling horizon driven strategy is specially designed. Considering the importance of computational efficiency in the dynamic environment, the traditional ant colony optimization is improved. On the one hand, a strategy of available routes compression to restrict ants’ movement is proposed so that the ants’ searching cycle for new solutions could be shorten. On the other hand, illuminating function in state transfer possibility is improved to facilitate the exploration of low pheromone trail. Performance of rolling horizon procedure and rescheduling algorithm are evaluated respectively through simulations, the results show the best parameters of rolling horizon procedure and demonstrate the feasibility and efficiency of rescheduling algorithm. An example from the practical production is addressed to verify the effectiveness of the proposed approach.

[1]  William G. Truscott.  Production scheduling with capacity-constrained transportation activities , 1986 .

[2]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[3]  François Marmier,et al.  Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints , 2012, Comput. Oper. Res..

[4]  M. Gholami,et al.  Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[5]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling surface mount technology lines , 2001 .

[6]  Fuh-Der Chou,et al.  A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan , 2011 .

[7]  Jaehwan Yang.  Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage , 2015, Comput. Oper. Res..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Tamás Kis,et al.  A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..

[10]  Ghaith Rabadi,et al.  A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times , 2010, J. Intell. Manuf..

[11]  GU Xing-sheng.  Immune scheduling algorithm for flow shop problems under uncertainty , 2005 .

[12]  Sanjay Mehta,et al.  Predictable scheduling of a single machine subject to breakdowns , 1999, Int. J. Comput. Integr. Manuf..

[13]  Chelliah Sriskandarajah,et al.  Scheduling and Lot Streaming in Flowshops with No-Wait in Process , 2003, J. Sched..

[14]  Rong-Hwa Huang,et al.  Multi-objective job-shop scheduling with lot-splitting production , 2010 .

[15]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[17]  Gilbert Laporte,et al.  Scheduling and lot streaming in two‐machine open shops with no‐wait in process , 2005 .

[18]  S. C. Liu.  A heuristic method for discrete lot streaming with variable sublots in a flow shop , 2003 .

[19]  Chris N. Potts,et al.  Flow shop scheduling with lot streaming , 1989 .

[20]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[21]  Kenneth R. Baker,et al.  Lot streaming in the two-machine flow shop with setup times , 1995, Ann. Oper. Res..

[22]  D. Quadt,et al.  Conceptual framework for lot-sizing and scheduling of flexible flow lines , 2005 .

[23]  Liang Xu.  Ant colony algorithm oriented to Job Shop scheduling problem based on self-adaptive and uneven windows , 2009 .

[24]  Tadeusz Sawik,et al.  Optimal versus heuristic scheduling of surface mount technology lines , 2004 .

[25]  Tamás Kis,et al.  Computing lower and upper bounds for a large-scale industrial job shop scheduling problem , 2009, Eur. J. Oper. Res..

[26]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[27]  Daoxiong Gong,et al.  A hybrid approach of GA and ACO for TSP , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[28]  Manoj Kumar Tiwari,et al.  Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling , 2015 .

[29]  Rubén Ruiz.  Lot-streaming for sequence dependent setup time flowshop problems. , 2010 .

[30]  Li Bingyu.  Ant Colony Algorithm Based on Little Window , 2003 .

[31]  Y Zhang.  Hybrid flow shop problem with batching machines and multi-jobs families , 2014 .

[32]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[33]  Wang Wan-shan.  Simulation and Analysis on Dynamic Job Shop Scheduling Toward Networked Manufacturing , 2008 .

[34]  N. Jawahar,et al.  Tabu Search and Simulated Annealing Algorithms for Scheduling in Flow Shops with Lot Streaming , 2007 .

[35]  M. T. Sze,et al.  A genetic algorithm of determining cycle time for printed circuit board assembly lines , 2001, Eur. J. Oper. Res..

[36]  Manfred Gronalt,et al.  Job sequencing and component set-up on a surface mount placement machine , 1998 .