Skip to main content

Advertisement

SpringerLink
Log in

Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints

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

Abstract

This paper focuses on minimizing the makespan for a reentrant hybrid flow shop scheduling problem with time window constraints (RHFSTW), which is often found in manufacturing systems producing the slider part of hard-disk drive products, in which production needs to be monitored to ensure high quality. For this reason, production time control is required from the starting-time-window stage to the ending-time-window stage. Because of the complexity of the RHFSTW problem, in this paper, genetic algorithm hybridized ant colony optimization (GACO) is proposed to be used as a support tool for scheduling. The results show that the GACO can solve problems optimally with reasonable computational effort.

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

Similar content being viewed by others

References

  • Abe, K., & Ida, K. (2008). Genetic local search method for re-entrant flow-shop problem. In C. H. Dagli, D. L. Enke, K. M. Bryden, H. Ceylan, & M. Gen (Eds.), Intelligent engineering systems through artificial neural networks (pp. 381–387). New Jersey: ASME Press.

    Chapter  Google Scholar 

  • Alaykyran, K., Engin, O., & Doyen, A. (2007). Using ant colony optimization to solve hybrid flow shop scheduling problems. International Journal of Advanced Manufacturing Technology, 35, 541–550.

    Article  Google Scholar 

  • Arnaout, J. P., Musa, R., & Rabadi, G. (2014). A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: Enhancements and experimentations. Journal of Intelligent Manufacturing, 25, 43–53.

    Article  Google Scholar 

  • Behnamian, J., Fatemi-Ghomi, S. M. T., & Zandieh, M. (2012). Hybrid flow shop scheduling with sequence-dependent setup times by hybridizing max-min ant system, simulated annealing and variable neighborhood search. Expert Systems, 29(2), 156–169.

    Google Scholar 

  • Chamnanlor, C., & Sethanan, K. (2009). Mixed integer programming models for scheduling hybrid flowshop with unrelated machines and time windows constraints. In Proceedings of the APIEMS2009 conference (pp. 2331–2335). Japan: Kitakyushu.

  • Chamnanlor, C., & Sethanan, K. (2013). Heuristics for scheduling hybrid flow shop with time windows. IACSIT International Journal of Engineering & Technology, 5(1), 41–44.

    Article  Google Scholar 

  • Chamnanlor, C., Sethanan, K., Chien, C. F., & Gen, M. (2013). Hybrid genetic algorithms for solving reentrant flow-shop scheduling with time windows. Industrial Engineering & Management Systems, 12(4), 306–316.

    Article  Google Scholar 

  • Chamnanlor, C., Sethanan, K., Chien, C. F., & Gen, M. (2014). Reentrant flow-shop scheduling with time windows using hybrid genetic algorithm based on auto-tuning strategy. International Journal of Production Research, 52(9), 2612–2629.

    Article  Google Scholar 

  • Chen, J. S., Pan, J. C. H., & Lin, C. M. (2008a). A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Systems with Applications, 34, 570–577.

    Article  Google Scholar 

  • Chen, J. S., Pan, J. C. H., & Wu, C. K. (2008b). Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Systems with Applications, 34, 1924–1930.

    Article  Google Scholar 

  • Chen, J. S., Pan, J. C. H., & Wu, C. K. (2007). Minimizing makespan in reentrant flow-shops using hybrid tabu search. International Journal of Advanced Manufacturing Technology, 34, 353–361.

    Article  Google Scholar 

  • Chien, C. F., & Chen, C. H. (2007). A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups. OR Spectrum, 29(3), 391–419.

    Article  Google Scholar 

  • Cho, H. M., Bae, S. J., Kim, J., & Jeong, I. J. (2011). Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Computers & Industrial Engineering, 61, 529–541.

    Article  Google Scholar 

  • Cho, D. W., Lee, Y. H., Lee, T. Y., & Gen, M. (2014). An adaptive genetic algorithm for the time dependent inventory routing problem. Journal of Intelligent Manufacturing, 25, 1025–1042.

    Article  Google Scholar 

  • Choi, H. S., Kim, H. W., Lee, D. H., Yoon, J., Yun, C. Y., & Kevin, B. C. (2009). Scheduling algorithms for two-stage reentrant hybrid flow shops: Minimizing makespan under the maximum allowable due date. International Journal of Advanced Manufacturing Technology, 42, 963–973.

    Article  Google Scholar 

  • Choi, H. S., Kim, J. S., & Lee, D. H. (2011). Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line. Expert Systems with Applications, 38, 3514–3521.

    Article  Google Scholar 

  • Danping, L., Lee, C. K. M., & Wu, Z. (2012). Integrating analytical hierarchy process to genetic algorithm for re-entrant flowshop scheduling problem. International Journal of Production Research, 50(7), 1813–1824.

    Article  Google Scholar 

  • Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 29–41.

    Article  Google Scholar 

  • Dorigo, M., & Stützle, T. (2004). Ant colony optimization. Cambridge: MIT Press.

    Google Scholar 

  • Dugardin, F., Amodeo, L., & Yalaoui, F. (2010a). FLC-archive to solve multiobjective reentrant hybrid flowshop scheduling problem. In Proceedings of the 2010 international conference on machine and web intelligence (pp. 324–329).

  • Dugardin, F., Yalaoui, F., & Amodeo, L. (2010b). New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research, 203, 22–31.

    Article  Google Scholar 

  • Gao, J., Gen, M., & Sun, L. (2006). Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. Journal of Intelligent Manufacturing, 17, 493–507.

    Article  Google Scholar 

  • Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35, 2892–2907.

    Article  Google Scholar 

  • Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization. New York: Wiley.

    Google Scholar 

  • Gen, M., Gao, J., & Lin, L. (2009). Multistage-based genetic algorithm for flexible job-shop scheduling problem. Intelligent and Evolutionary Systems, 187, 183–196.

    Article  Google Scholar 

  • Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing Systems, 25, 849–866.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Guinet, A., Solomon, M. M., Kedia, P. K., & Dussauchoy, A. (1996). A computational study of heuristics for two-stage flexible flow-shops. International Journal of Production Research, 34(5), 1399–1415.

    Article  Google Scholar 

  • Gupta, J. N. D. (1988). Two-stage hybrid flow-shop scheduling problem. Journal of Operation Research Society, 39, 359–364.

    Article  Google Scholar 

  • Hao, X. C., Wu, J. Z., Chien, C. F., & Gen, M. (2014). The cooperative estimation of distribution algorithm: A novel approach for semiconductor final test scheduling problems. Journal of Intelligent Manufacturing, 25, 867–879.

    Article  Google Scholar 

  • Hekmatfar, M., Fatemi Ghomi, S. M. T., & Karimi, B. (2011). Two stage reentrant hybrid flow shops with setup times and the criterion of minimizing makespan. Applied Soft Computing, 11(8), 4530–4539.

    Article  Google Scholar 

  • Holland, J. H. (1975). Adaption in natural and artificial systems. Ann Arbor, Mich: University of Michigan Press.

    Google Scholar 

  • Huang, R. H., & Yang, C. L. (2008). Ant colony system for job shop scheduling with time windows. International Journal of Advanced Manufacturing Technology, 39, 151–157.

    Article  Google Scholar 

  • Hwang, H., & Sun, J. U. (1997). Production sequencing problem with reentrant work flows and sequence dependent setup times. Computers & Industrial Engineering, 33, 773–776.

    Article  Google Scholar 

  • Jiang, S., & Tang, L. (2008). Lagrangian relaxation algorithms for re-entrant hybrid flowshop scheduling. In Proceedings of the 2008 international conference on information management, innovation management and industrial engineering (pp. 78–81). New Jersey, USA: Piscataway.

  • Jing, C., Tang, G., & Qian, X. (2008). Heuristic algorithms for two machine re-entrant flow shop. Theoretical Computer Science, 400, 137–143.

    Article  Google Scholar 

  • Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2007). Constructive and simulated annealing algorithms for hybrid flow shop problems with unrelated parallel machines. Thammasat International Journal of Science and Technology, 12(1), 31–41.

    Google Scholar 

  • Khalouli, S., Ghedjati, F., & Hamzaoui, A. (2010). A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. Engineering Applications of Artificial Intelligence, 23, 765–771.

    Article  Google Scholar 

  • Kim, H. W., & Lee, D. H. (2009). Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacturing, 223, 433–442.

    Article  Google Scholar 

  • Lin, L., & Gen, M. (2009). Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation. Soft Computing, 13, 157–168.

    Article  Google Scholar 

  • Lin, L., Hao, X. C., Gen, M., & Jo, J. B. (2012). Network modeling and evolutionary optimization for scheduling in manufacturing. Journal of Intelligent Manufacturing, 23, 2237–2253.

    Article  Google Scholar 

  • Luo, H., Zhang, A., & Huang, G. Q. (2015). Active scheduling for hybrid flowshop with family setup time and inconsistent family formation. Journal of Intelligent Manufacturing, 26, 169–187.

    Article  Google Scholar 

  • Pan, J. C. H., & Chen, J. S. (2003). Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society, 54, 642–653.

    Article  Google Scholar 

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 34, 3202–3212.

    Article  Google Scholar 

  • Pinedo, M. (2012). Scheduling: Theory, algorithms, and systems (4th ed.). Englewood Cliff, New Jersey: Prentice-Hall.

    Book  Google Scholar 

  • Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34–54.

    Article  Google Scholar 

  • Sethanan, K. (2001). Scheduling flexible flow-shops with sequence dependent setup time. Ph.D. dissertation, West Virginia University, West Virginia, USA.

  • Song, Y. H., Wang, G. S., Wang, P. T., & Johns, A. T. (1997). Environment/economic dispatch using fuzzy logic controlled genetic algorithm. Proceedings of IEEE on Generation, Transmission and Distribution, 114(4), 337–382.

  • Takeyasu, K., & Kainosho, M. (2014). Optimization technique by genetic algorithms for international logistics. Journal of Intelligent Manufacturing, 25, 1043–1049.

    Article  Google Scholar 

  • Yalaoui, N., Amodeo, L., Yalaoui, F., & Mahdi, H. (2010). Particle swarm optimization under fuzzy logic controller for solving a hybrid reentrant flow shop problem. In Proceedings of the IEEE international symposium on parallel & distributed processing, workshops and Ph.D. Forum. Atlanta, GA, USA.

  • Ying, K. C., Lin, S. W., & Wan, S. Y. (2014). Bi-objective reentrant hybrid flowshop scheduling: An iterated Pareto greedy algorithm. International Journal of Production Research, 52(19), 5735–5747.

  • Yun, Y. S., & Gen, M. (2003). Performance analysis of adaptive genetic algorithms with fuzzy logic and heuristics. Fuzzy Optimization Decision Making, 2(2), 161–175.

    Article  Google Scholar 

  • Zhang, H., & Gen, M. (2009). A parallel hybrid ant colony optimization approach for job-shop scheduling problem. International Journal of Manufacturing Technology and Management, 16(1/2), 22–41.

    Article  Google Scholar 

Download references

Acknowledgments

This project was financially supported by the Industry/University Cooperative Research Center (I/UCRC) in HDD Components, the research unit on System Modeling for Industry, the Faculty of Engineering, Khon Kaen University and National Electronics and Computer Technology Center, National Science and Technology Development Agency.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

    Chettha Chamnanlor & Kanchana Sethanan

  2. Tokyo University of Science, Tokyo, 125-8585, Japan

    Mitsuo Gen

  3. Fuzzy Logic Systems Institute, Iizuka, Fukuoka, 820-0067, Japan

    Mitsuo Gen

  4. Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, 30013, Taiwan, ROC

    Chen-Fu Chien

Authors
  1. Chettha Chamnanlor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kanchana Sethanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mitsuo Gen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chen-Fu Chien
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kanchana Sethanan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chamnanlor, C., Sethanan, K., Gen, M. et al. Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J Intell Manuf 28, 1915–1931 (2017). https://doi.org/10.1007/s10845-015-1078-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1078-9

Keywords

Search

Navigation