Skip to main content

Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities

  • Conference paper
Optimization, Control, and Applications in the Information Age

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 130))

  • 1090 Accesses

Abstract

This chapter investigates a novel multi-objective model of a batch scheduling problem with constraint of the mould capability, and the objective is to minimize both the total completion time of the jobs and the total cost of the moulds. It is extremely difficult to obtain an optimal solution to this type of complex problems in a reasonable computational time. In view of this, this chapter presents a new multi-objective algorithm based on the features of Gravitational Search Algorithm to find Pareto optimal solutions for the given problem. In the proposed algorithm a novel Pareto frontier adjustment strategy is designed and proven to improve the convergence of solutions and increase convergence speed. We examined a set of test problems to validate the high efficiency of the proposed multi-objective gravitational search algorithm based on a variety of metrics. Finally, a multi-attribute decision making method is employed to determine the trade-off solutions derived from the Pareto optimal set and thus solve the problem optimally.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albers, S., Brucker, P.: The complexity of one-machine batching problems. Discret. Appl. Math. 47(2), 87–107 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Azzi, A., Faccio, M., Persona, A., Sgarbossa, F.: Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production. Int. J. Adv. Manuf. Technol. 59(5–8), 775–786 (2012)

    Article  Google Scholar 

  3. Baptiste, P.: Batching identical jobs. Math. Meth. Oper. Res. 52, 355–367 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chinchuluun, A., Pardalos, P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 54(1), 29–50 (2007)

    Article  MathSciNet  Google Scholar 

  5. Coffman, E.G., Yannakakis, M., Magazine, M.J., Santos, C.: Batch sizing and job sequencing on a single machine. Ann. Oper. Res. 2(1), 135–147 (1990)

    Article  MathSciNet  Google Scholar 

  6. Damodaran, P., Diyadawagamage, D.A., Velez-Gallego, M.C., Ghrayeb, O.: A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int. J. Adv. Manuf. Technol. 58(9–12), 1131–1140 (2012)

    Article  Google Scholar 

  7. Davis, L.: Hand Book of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  8. Deb, K., Pratap, A., Agrawal, S.: A fast and elitist multi objective genetic algorithm: Nsga-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  9. Fontes, D.B.M.M., Gaspar-Cunha, A.: On multi-objective evolutionary algorithms. In: Zopounidis, C., Pardalos, P.M. (eds.) Handbook of Multicriteria Analysis. Applied Optimization, vol. 103, chap. 10, pp. 287–310. Springer, Berlin (2010)

    Google Scholar 

  10. Gao, L., Wang, C., Wang, D., Yin, Z., Wang, S.: Heuristic to schedule grouped jobs on parallel machines with mould constraint. Control Decis. 14(5), 392–397 (1999)

    MathSciNet  Google Scholar 

  11. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  12. Haddad, H., Ghanbari, P., Moghaddam, A.Z.: A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs. J. Ind. Eng. Comput. 3(2), 253–264 (2012)

    Google Scholar 

  13. Hong, T., Sun, P., Jou, S.: Evolutionary computation for minimizing makespan on identical machines with mold constrains. WSEAS Trans. Syst. Control4(7), 339–348 (2009)

    Google Scholar 

  14. Kashan, A.H., Karimi, B., Jolai, F.: An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes. Eng. Appl. Artif. Intell. 23(6), 911–922 (2010)

    Article  Google Scholar 

  15. Loukil, T., Teghem, J., Fortemps, F.: A multi-objective production scheduling case study solved by simulated annealing. Eur. J. Oper. Res. 179(3), 709–722 (2007)

    Article  MATH  Google Scholar 

  16. Manjeshwar, P.K., Damodaran, P., Srihari, K.: Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines. Int. J. Adv. Manuf. Technol. 55(9–12), 1171–1182 (2011)

    Article  Google Scholar 

  17. Mathirajan, M., Bhargav, V., Ramachandran, V.: Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates. Int. J. Adv. Manuf. Technol. 48(9–12), 1133–1148 (2010)

    Article  Google Scholar 

  18. Mirsanei, H.S., Karimi, B., Jolai, F.: Flow shop scheduling with two batch processing machines and nonidentical job sizes. Int. J. Adv. Manuf. Technol. 45(5–6), 553–572 (2009)

    Article  Google Scholar 

  19. Ng, C.T., Cheng, T.C.E., Yuan, J.J.: A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Oper. Res. Lett. 30(1), 66–68 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Nong, Q., Ng, C.T., Cheng, T.C.E.: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. Oper. Res. Lett. 36(1), 61–66 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  21. Pei, J., Fan, W., Pardalos, P. M., Liu, X., Goldengorin, B., Yang, S.: Preemptive scheduling in a two-stage supply chain to minimize the makespan. Optim. Methods Softw. (2014). (Online) doi:10.1080/10556788.2014.969262

    Google Scholar 

  22. Pei, J., Liu, X., Pardalos, P.M., Fan, W., Wang, L., Yang, S.: Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm. Int. J. Syst. Sci. (2014). (Online) doi:10.1080/00207721.2014.902553

    Google Scholar 

  23. Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70(1–4), 335–348 (2014)

    Article  Google Scholar 

  24. Pei, J., Pardalos, P.M., Liu, X., Fan, W., Yang, S.: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res. (2014). (Online) doi:10.1016/j.ejor.2014.11.034

    Google Scholar 

  25. Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optim. Lett. 9(1), 91–104 (2015)

    Article  MathSciNet  Google Scholar 

  26. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228–249 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  27. Qiao, L.L.F., Wu, Q.D.: Aco-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints. Int. J. Adv. Manuf. Technol. 44(9–10), 985–994 (2009)

    Google Scholar 

  28. Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)

    Article  MATH  Google Scholar 

  29. Ren, H., Jiang, L., Xi, X., Li, M.: Heuristic optimization for dual-resource constrained job shop scheduling. In: 2009 International Asia Conference on Informatics in Control, Automation and Robotics, pp. 485–488 (2009)

    Google Scholar 

  30. Su, L.H., Chen, J.C.: Sequencing two-stage flowshop with non-identical job sizes. Int. J. Adv. Manuf. Technol. 47(1–4), 259–268 (2010)

    Article  Google Scholar 

  31. Wang, T.C., Lee, H.D.: Developing a fuzzy topsis approach based on subjective weights and objective weights. Expert Syst. Appl. 36(5), 8980–8985 (2009)

    Article  MathSciNet  Google Scholar 

  32. Webster, S.T., Baker, K.R.: Scheduling groups of jobs on a single machine. Oper. Res. 43(4), 692–703 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  33. Xi, X., Jiang, L., Zhang, Q.: Optimization for multi-resources-constrained job shop scheduling based on three-level heuristic algorithm. In: 2009, International Asia Conference on Informatics in Control, Automation and Robotics, pp. 296–300 (2009)

    Google Scholar 

  34. Xu, X., Ying, S., Wang, W.: Fuzzy flexible job-shop scheduling method based on multi-agent immune algorithm. Control Decis. 25(2), 171–178 (2010)

    MATH  Google Scholar 

  35. Xuan, H., Tang, L.: Scheduling a hybrid flowshop with batch production at the last stage. Comput. Oper. Res. 34(7), 2718–2733 (2007)

    Article  MATH  Google Scholar 

  36. Zhang, T., Chaovalitwongse, W.A., Zhang, Y.J., Pardalos, P.M.: The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem. J. Ind. Manag. Optim. 5(4), 749–765 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Pei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Pei, J., Migdalas, A., Fan, W., Liu, X. (2015). Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities. In: Migdalas, A., Karakitsiou, A. (eds) Optimization, Control, and Applications in the Information Age. Springer Proceedings in Mathematics & Statistics, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-18567-5_14

Download citation

Publish with us

Policies and ethics