Skip to main content

Advertisement

SpringerLink
Log in

Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines

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

Abstract

The flexibilities of alternative process plans and unrelated parallel machines are benefit for the optimization of the job shop scheduling problem, but meanwhile increase the complexity of the problem. This paper constructs the mathematical model for the multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines, splits the problem into two sub-problems, namely flexible processing route decision and task sorting, and proposes a two-generation (father and children) Pareto ant colony algorithm to generate a feasible scheduling solution. The father ant colony system solves the flexible processing route decision problem, which selects the most appropriate process node set from the alternative process node set. The children ant colony system solves the sorting problem of the process task set generated by the father ant colony system. The Pareto ant colony system constructs the applicable pheromone matrixes and heuristic information with respect to the sub-problems and objectives. And NSGAII is used as comparison whose genetic operators are re-defined. The experiment confirms the validation of the proposed algorithm. By comparing the result of the algorithm to NSGAII, we can see the proposed algorithm has a better performance.

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
Fig. 13

Similar content being viewed by others

References

  • Alaya, I., Solnon, C., & Ghedira, K. (2007). Ant colony optimization for multi-objective optimization problems. In 2007 19th IEEE international conference on tools with artificial intelligence (pp. 450–457).

  • 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(1), 43–53. doi:10.1007/s10845-012-0672-3.

    Article  Google Scholar 

  • 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(6), 693–701. doi:10.1007/s10845-009-0246-1.

    Article  Google Scholar 

  • Attar, S. F., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2013). Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times. International Journal of Advanced Manufacturing Technology, 68(5–8), 1583–1599. doi:10.1007/s00170-013-4956-3.

    Article  Google Scholar 

  • Chaharsooghi, S. K., & Meimand Kermani, A. H. (2008). An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP). Applied Mathematics and Computation, 200(1), 167–177. doi:10.1016/j.amc.2007.09.070.

    Article  Google Scholar 

  • Cheng, J., Zhang, G., Li, Z., & Li, Y. (2012). Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems. Soft Computing, 16(4), 597–614. doi:10.1007/s00500-011-0759-3.

    Article  Google Scholar 

  • Chi-Wei, L., Yang-Kuei, L., & Han-Ting, H. (2013). Ant colony optimization for unrelated parallel machine scheduling. International Journal of Advanced Manufacturing Technology, 67(1–4), 35–45. doi:10.1007/s00170-013-4766-7.

    Google Scholar 

  • Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. Ieee Transactions on Evolutionary Computation, 6(2), 182–197. doi:10.1109/4235.996017.

    Article  Google Scholar 

  • Doerner, K., Gutjahr, W. J., Hartl, R. F., Strauss, C., & Stummer, C. (2004). Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection. Annals of Operations Research, 131(1–4), 79–99. doi:10.1023/B:ANOR.0000039513.99038.c6.

    Article  Google Scholar 

  • Dousthaghi, S., Tavakkoli-Moghaddam, R., & Makui, A. (2013). Solving the economic lot and delivery scheduling problem in a flexible job shop with unrelated parallel machines and a shelf life by a proposed hybrid PSO. International Journal of Advanced Manufacturing Technology, 68(5–8), 1401–1416. doi:10.1007/s00170-013-4930-0.

    Article  Google Scholar 

  • García-Martínez, C., Cordón, O., & Herrera, F. (2004). An empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L., Mondada, F., & Stützle, T. (Eds.), Ant colony optimization and swarm intelligence, Lecture notes in computer science (Vol. 3172, pp. 61–72). Springer, Berlin, Heidelberg.

  • García-Martínez, C., Cordón, O., & Herrera, F. (2007). A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. European Journal of Operational Research, 180(1), 116–148. doi:10.1016/j.ejor.2006.03.041.

    Article  Google Scholar 

  • Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866. doi:10.1007/s10845-013-0804-4.

    Article  Google Scholar 

  • Hao-Chin, C., Hung-Te, T., & Tung-Kuan, L. (2014). Application of genetic algorithm to optimize unrelated parallel machines of flexible job-shop scheduling problem. In 11th IEEE international conference on control and automation.

  • Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2009). A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers and Operations Research, 36(2), 358–378. doi:10.1016/j.cor.2007.10.004.

    Article  Google Scholar 

  • Kuo-Ching, Y., Zhe-Jung, L., & Shih-Wei, L. (2012). Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent Manufacturing, 23(5), 1795–1803. doi:10.1007/s10845-010-0483-3.

    Article  Google Scholar 

  • Lee, J.-H., Yu, J.-M., & Lee, D.-H. (2013). A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: Minimizing total tardiness. International Journal of Advanced Manufacturing Technology, 69(9–12), 2081–2089. doi:10.1007/s00170-013-5192-6.

    Article  Google Scholar 

  • Leung, C. W., Wong, T. N., Mak, K. L., & Fung, R. Y. K. (2010). Integrated process planning and scheduling by an agent-based ant colony optimization. Computers and Industrial Engineering, 59(1), 166–180. doi:10.1016/j.cie.2009.09.003.

    Article  Google Scholar 

  • Li, X., Huang, Y., Tan, Q., & Chen, H. (2013). Scheduling unrelated parallel batch processing machines with non-identical job sizes. Computers and Operations Research, 40(12), 2983–2990. doi:10.1016/j.cor.2013.06.016.

    Article  Google Scholar 

  • Lin, Y.-K., & Hsieh, F.-Y. (2014). Unrelated parallel machine scheduling with setup times and ready times. International Journal of Production Research, 52(4), 1200–1214. doi:10.1080/00207543.2013.848305.

    Article  Google Scholar 

  • Mohapatra, P., Nayak, A., Kumar, S. K., & Tiwari, M. K. (2015). Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm. International Journal of Production Research, 53(6), 1712–1735. doi:10.1080/00207543.2014.957872.

    Article  Google Scholar 

  • Moncayo-Martinez, L. A., & Zhang, D. Z. (2011). Multi-objective ant colony optimisation: A meta-heuristic approach to supply chain design. International Journal of Production Economics, 131(1), 407–420. doi:10.1016/j.ijpe.2010.11.026.

    Article  Google Scholar 

  • Ozguven, C., Ozbakir, L., & Yavuz, Y. (2010). Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34(6), 1539–1548. doi:10.1016/j.apm.2009.09.002.

    Article  Google Scholar 

  • Rabadi, G., Moraga, R. J., & Al-Salem, A. (2006). Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing, 17(1), 85–97. doi:10.1007/s10845-005-5514-0.

  • Rabiee, M., Rad, R. S., Mazinani, M., & Shafaei, R. (2014). An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. International Journal of Advanced Manufacturing Technology, 71(5–8), 1229–1245. doi:10.1007/s00170-013-5375-1.

    Article  Google Scholar 

  • Rodriguez, F. J., Lozano, M., Blum, C., & Garcia-Martinez, C. (2013). An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Computers and Operations Research, 40(7), 1829–1841. doi:10.1016/j.cor.2013.01.018.

    Article  Google Scholar 

  • Wang, I. L., Yang, T., & Chang, Y.-B. (2012). Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. Journal of Intelligent Manufacturing, 23(6), 2271–2280. doi:10.1007/s10845-011-0571-z.

    Article  Google Scholar 

  • Wang, I. L., Yi-Chi, W., & Chih-Wei, C. (2013). Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics. Flexible Services and Manufacturing Journal, 25(3), 343–366. doi:10.1007/s10696-012-9150-7.

    Article  Google Scholar 

  • Wong, T. N., Zhang, S., Wang, G., & Zhang, L. (2012). Integrated process planning and scheduling - multi-agent system with two-stage ant colony optimisation algorithm. International Journal of Production Research, 50(21), 6188–6201. doi:10.1080/00207543.2012.720393.

    Article  Google Scholar 

  • Xiao-jun, L., Hong, Y., & Zhong-hua, N. (2013). Application of ant colony optimization algorithm in process planning optimization. Journal of Intelligent Manufacturing, 24(1), 1–13. doi:10.1007/s10845-010-0407-2.

    Article  Google Scholar 

  • Xinyu, L., Liang, G., Xinyu, S., Chaoyong, Z., & Cuiyu, W. (2010a). Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling. Computers and Operations Research, 37(4), 656–667. doi:10.1016/j.cor.2009.06.008.

    Article  Google Scholar 

  • Xinyu, L., Xinyu, S., Liang, G., & Weirong, Q. (2010). An effective hybrid algorithm for integrated process planning and scheduling. International Journal of Production Economics, 126(2), 289–298. doi:10.1016/j.ijpe.2010.04.001.

    Article  Google Scholar 

  • Xinyu, S., Xinyu, L., Liang, G., & Chaoyong, Z. (2009). Integration of process planning and scheduling—A modified genetic algorithm-based approach. Computers and Operations Research, 36(6), 2082–2096. doi:10.1016/j.cor.2008.07.006.

    Article  Google Scholar 

  • Yeo Keun, K., Kitae, P., & Jesuk, K. (2003). A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Computers and Operations Research, 30(8), 1151–1171.

    Article  Google Scholar 

  • Yildiz, A. R. (2013a). A new hybrid artificial bee colony algorithm for robust optimal design and manufacturing. Applied Soft Computing, 13(5), 2906–2912. doi:10.1016/j.asoc.2012.04.013.

    Article  Google Scholar 

  • Yildiz, A. R. (2013b). Optimization of cutting parameters in multi-pass turning using artificial bee colony-based approach. Information Sciences, 220, 399–407. doi:10.1016/j.ins.2012.07.012.

    Article  Google Scholar 

  • Zhu, X., Zhang, Z., Zhu, X., & Hu, J. (2014). An ant colony optimization algorithm for multi-objective disassembly line balancing problem. China Mechanical Engineering, 25(8), 1075–1079.

    Google Scholar 

  • Zitzler, E., Deb, K., & Thiele, L. (2000). Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(2), 173–195. doi:10.1162/106365600568202.

    Article  Google Scholar 

Download references

Acknowledgments

This research work is supported by the National Science and Technology Major Project of China under Grant No. 2012ZX04010-071.

Author information

Authors and Affiliations

  1. Xi’an Jiaotong University, Xi’an, China

    Boxuan Zhao, Jianmin Gao, Kun Chen & Ke Guo

Authors
  1. Boxuan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianmin Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ke Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boxuan Zhao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, B., Gao, J., Chen, K. et al. Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. J Intell Manuf 29, 93–108 (2018). https://doi.org/10.1007/s10845-015-1091-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1091-z

Keywords

Search

Navigation