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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albers, S., Brucker, P.: The complexity of one-machine batching problems. Discret. Appl. Math. 47(2), 87–107 (1993)
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)
Baptiste, P.: Batching identical jobs. Math. Meth. Oper. Res. 52, 355–367 (2000)
Chinchuluun, A., Pardalos, P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 54(1), 29–50 (2007)
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)
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)
Davis, L.: Hand Book of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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
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
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)
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
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)
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228–249 (2000)
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)
Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009)
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)
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)
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)
Webster, S.T., Baker, K.R.: Scheduling groups of jobs on a single machine. Oper. Res. 43(4), 692–703 (1995)
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)
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)
Xuan, H., Tang, L.: Scheduling a hybrid flowshop with batch production at the last stage. Comput. Oper. Res. 34(7), 2718–2733 (2007)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-3-319-18567-5_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18566-8
Online ISBN: 978-3-319-18567-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)