Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Arnaout, J. P., Rabadi, G., & Musa, R. (2010). A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing, 21, 693–701.

  • Babu, S. A. K. I., Pratap, S., Lahoti, G., Fernandes, K. J., Tiwari, M. K., Mount, M., et al. (2014). Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling. Maritime Economics and Logistics. doi:10.1057/Mel.20.

  • Baker, K. R. (1995). Lot streaming in the two-machine flow shop with set-up times. Annals of Operations Research, 57, 1–11.

  • Bose, S. K. (2002). An introduction to queuing systems. New York: Kluwer Academic/Pelenum Publishers.

  • Chang, P. C., Hsieh, J. C., & Wang, C. Y. (2007). Adaptive multi-objective genetic algorithm for scheduling of drilling operation in printed circuit board industry. Applied Soft Computing, 7, 800–806.

  • Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italie.

  • Dorigo, M., Caro, G. D., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53–66.

  • Dorigo, M., & Gambardella, L. M. (1997). Ant colonies for the travelling salesman problem. BioSystem, 43, 73–81.

  • Drótos, M., Erdős, G., & Kis, T. (2009). Computing lower and upper bounds for a large-scale industrial job shop scheduling problem. European Journal of Operational Research, 197, 296–306.

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.

  • Gholami, M., Zandieh, M., & Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Advanced Manufacturing Technology, 42(1–2), 189–201.

  • Gong, D. X., Ruan, X. G. (2004). A hybrid approach of GA and ACO for TSP [C] // Proceedings of the 5th world congress on intelligent control and automation. Washington, D. C., USA: IEEE, 3: 2068–2072.

  • Gunther, H. O., Gronalt, M., & Zeller, R. (1998). Job sequencing and component set-up on a surface mount placement machine. Production Planning & Control, 9, 201–211.

  • Hall, N. G., Laporte, G., Selvarajah, E., & Sriskandarajah, C. (2003). Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6, 339–354.

  • Huang, R. H. (2010). Multi-objective job-shop scheduling with lot-splitting production. International Journal of Production Economics, 124, 206–213.

  • Huang, M., Liu, P. F., & Liang, X. (2009). Ant colony algorithm oriented to Job Shop scheduling problem based on self-adaptive and uneven windows. Computer Integrated Manufacturing Systems, 15(10), 1973–1978.

  • Ji, P., Sze, M. T., & Lee, W. B. (2001). A genetic algorithm of determining cycle time for printed circuit board assembly lines. European Journal of Operational Research, 128, 175–184.

  • Kaczmarczyk, W., Sawik, T., Schaller, A., & Tirpaks, T. (2004). Optimal versus heuristic scheduling of surface mount technology lines. International Journal of Production Research, 42, 2083–2110.

  • Kis, T., & Pesch, E. (2005). A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164, 592–608.

  • Lamothe, J., Marmier, F., Dupuy, M., Gaborit, P., & Dupont, L. (2012). Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. Computer & Operation Research, 39, 1236–1244.

  • Linn, R., & Zhang, W. (1999). Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37(1–2), 57–61.

  • Liu, G. B. (2012). Research on production scheduling methods of complex unrelated parallel machines. Shanghai: Shanghai Jiao Tong University.

  • Liu, S. C. (2003). A heuristic method for discrete lot streaming with variable sub-lots in a flow shop. International Journal of Advanced Manufacturing Technology, 22, 662–668.

  • Marimuthu, S., Ponnambalam, S. G., & Jawahar, N. (2007). Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming. Proceedings of the Institution of Mechanical Engineers Vol. 221 Part B: Journal of Engineer Manufacture, 317–331.

  • Mehta, S. V., & Uzsoy, R. (1999). Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12(1), 15–38.

  • Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operations Research Letters, 8, 297–303.

  • Quadt, D., & Kuhn, H. (2005). Conceptual framework for lot-sizing and scheduling of flexible flow lines. Interational Journal of Production Research, 43, 2291–2308.

  • Ruiz, R. (2010). Lot-streaming for sequence dependent setup time flowshop problems. In Proceedings of 4th international conference on industrial engineering and industrial management. Donostia, Spain.

  • Salvador, M. S. (1973). A solution to a special class of flow shop scheduling problems. In S. E. Elmaghraby (Ed.), Symposium on the theory of scheduling and its applications (pp. 83–91). Berlin: Springer.

  • Sawik, T. (2001). Mixed integer programming for scheduling surface mount technology lines. International Journal of Production Research, 39, 3219–3235.

  • Truscott, W. (1986). Production scheduling with capacity constrained transportation activities. Journal of Operation Management, 6, 333–348.

  • Wang, H. M., Chou, F. D., & Wu, F. C. (2011). A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan. International Journal of Advanced Manufacturing Technology, 53, 761–776.

  • Wu, K. (2007). Study on manufacturing execution process monitoring and control for multi type and volume production. Beijing: Beijing Institute of Technology.

  • Xiao, Y., & Li, B. (2003). Ant colony algorithm based on little window. Computer Engineering, 20, 056.

  • Xu, Z., & Gu, X. (2005). Immune scheduling algorithm for flow shop problems under uncertainty. XITONG GONGCHENG XUEBAO, 20(4), 374.

  • Yang, J. (2015). Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. Computers & Operations Research, 58, 1–8.

  • Zhang, Y., Rong, Z. J., M J. (2014). Hybrid flow shop problem with batching machines and multi-jobs families. Computer Integrated Manufacturing Systems, 20(2): 407–413.

  • Zhao, H., Tang, L., & Zhang, Y. (2008). Simulation and analysis on dynamic job shop scheduling toward networked manufacturing. Journal of System Simulation, 11, 057.

Download references

Acknowledgments

The authors would like to acknowledge the financial support of the National Science Foundation of China (No. 51435009).

Author information

Authors and Affiliations

  1. School of Mechanical Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai, China

    W. Qin, J. Zhang & D. Song

Authors
  1. W. Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qin, W., Zhang, J. & Song, D. An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. J Intell Manuf 29, 891–904 (2018). https://doi.org/10.1007/s10845-015-1144-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1144-3

Keywords

Search

Navigation