Abstract
Job-based scheduling problems have inherent similarities and relations. However, the current researches on these scheduling problems are isolated and lack references. We propose a unified solution framework containing two innovative strategies: the packet scheduling strategy and the greedy dispatching rule. It can increase the diversity of solutions and help in solving the problems with large solution space effectively. In addition, we propose an improved particle swarm optimization (PSO) algorithm with a variable neighborhood local search mechanism and a perturbation strategy. We apply the solution framework combined with the improved PSO to the benchmark instances of different job-based scheduling problems. Our method provides a self-adaptive technique for various job-based scheduling problems, which can promote mutual learning between different areas and provide guidance for practical applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, K., Zhang, X., Leung, Y.T., Yang, S.L.: Parallel machine scheduling problems in green manufacturing industry. J. Manuf. Syst. 38, 98–106 (2016)
Liu, W., Liang, Z., Ye, Z., Liu, L.: The optimal decision of customer order decoupling point for order insertion scheduling in logistics service supply chain. Int. J. Prod. Econ. 175, 50–60 (2016)
Abdullahi, M., Ngadi, M.A., Abdulhamid, S.M.: Symbiotic organism search optimization based task scheduling in cloud computing environment. Futur. Gener. Comput. Syst. 56, 640–650 (2016)
Sharma, R., Kumar, N., Gowda, N.B., Srinivas, T.: Probabilistic prediction based scheduling for delay sensitive traffic in Internet of Things. Procedia Comput. Sci. 52(1), 90–97 (2015)
Kong, W., Lei, Y., Ma, J.: Virtual machine resource scheduling algorithm for cloud computing based on auction mechanism. Optik Int. J. Light Electron Opt. 127(12), 5099–5104 (2016)
Freitag, M., Hildebrandt, T.: Automatic design of scheduling rules for complex manufacturing systems by multi-objective simulation-based optimization. CIRP Ann. Manuf. Technol. 65(1), 433–436 (2016)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, November 1995
Lu, H., Niu, R., Liu, J., Zhu, Z.: A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl. Soft Comput. 13(5), 2790–2802 (2013)
Lu, H., Zhu, Z., Wang, X., Yin, L.: A variable neighborhood MOEA/D for multiobjective test task scheduling problem. Math. Prob, Eng. 2014(3), 1–14 (2014)
Bean, J.C.: Genetics and random keys for sequencing and optimization. In: Production Scheduling (1993)
Shi, J., Lu, H., Mao, K.: Solving the test task scheduling problem with a genetic algorithm based on the scheme choice rule. In: Tan, Y., Shi, Y., Li, L. (eds.) ICSI 2016. LNCS, vol. 9713, pp. 19–27. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41009-8_3
Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)
Wang, J.F., Du, B.Q., Ding, H.M.: A genetic algorithm for the flexible job-shop scheduling problem. In: Shen, G., Huang, X. (eds.) CSIE 2011. CCIS, vol. 152, pp. 332–339. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21402-8_54
Ziaee, M.: A heuristic algorithm for solving flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 71(1–4), 519–528 (2014)
Gao, K.Z., Suganthan, P.N., Chua, T.J., Chong, C.S., Cai, T.X., Pan, Q.K.: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21), 7652–7663 (2015)
Palacios, J.J., González, M.A., Vela, C.R., Gonzlez-Rodríguez, I., Puente, J.: Genetic tabu search for the fuzzy flexible job shop problem. Comput. Oper. Res. 54(1), 74–89 (2015)
Yuan, Y., Xu, H.: Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336–353 (2014)
Vallada, E.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3), 612–622 (2011)
Acknowledgement
This research is supported by the National Natural Science Foundation of China under Grant No. 61671041.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zhou, R., Lu, H., Shi, J. (2018). A Solution Framework Based on Packet Scheduling and Dispatching Rule for Job-Based Scheduling Problems. In: Tan, Y., Shi, Y., Tang, Q. (eds) Advances in Swarm Intelligence. ICSI 2018. Lecture Notes in Computer Science(), vol 10942. Springer, Cham. https://doi.org/10.1007/978-3-319-93818-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-93818-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93817-2
Online ISBN: 978-3-319-93818-9
eBook Packages: Computer ScienceComputer Science (R0)