{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:14:26Z","timestamp":1751429666584,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T00:00:00Z","timestamp":1517961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the National Science and Technology Supporting Plan of China","award":["No. 2012BAF15G01"],"award-info":[{"award-number":["No. 2012BAF15G01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11277-018-5440-z","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T12:19:46Z","timestamp":1518005986000},"page":"255-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Research on Multi-objective Job Shop Scheduling with Dual Particle Swarm Algorithm Based on Greedy Strategy"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5649-0999","authenticated-orcid":false,"given":"Qiaofeng","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"issue":"2","key":"5440_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"5440_CR2","doi-asserted-by":"crossref","unstructured":"Ma, P. C., Tao, F., Liu, Y. L., et al. (2014). A hybrid particle swarm optimization and simulated annealing algorithm for job-shop scheduling. In IEEE international conference on automation science and engineering. IEEE (pp. 125\u2013130).","DOI":"10.1109\/CoASE.2014.6899315"},{"key":"5440_CR3","first-page":"269","volume":"1","author":"DM Ryan","year":"1981","unstructured":"Ryan, D. M., & Foster, B. A. (1981). An integer programming approach to scheduling. Publication of Elsevier Science Publishers Bv, 1, 269\u2013280.","journal-title":"Publication of Elsevier Science Publishers Bv"},{"key":"5440_CR4","first-page":"107","volume-title":"Beyond manufacturing resource planning (MRP II)","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Jurisch, B., & Sievers, B. (1998). A branch and bound algorithm for the job-shop scheduling problem. In A. Drexl & A. Kimms (Eds.), Beyond manufacturing resource planning (MRP II) (pp. 107\u2013127). Berlin: Springer."},{"issue":"1","key":"5440_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m -machine, n -job flow-shop sequencing problem. Omega, 11(1), 91\u201395.","journal-title":"Omega"},{"issue":"1","key":"5440_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0967-0661(94)90571-1","volume":"2","author":"TM Willems","year":"1994","unstructured":"Willems, T. M., & Rooda, J. E. (1994). Neural networks for job-shop scheduling. Control Engineering Practice, 2(1), 31\u201339.","journal-title":"Control Engineering Practice"},{"issue":"3","key":"5440_CR7","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TIE.2010.2048290","volume":"58","author":"A Yahyaoui","year":"2011","unstructured":"Yahyaoui, A., Fnaiech, N., & Fnaiech, F. (2011). A suitable initialization procedure for speeding a neural network job-shop scheduling. Industrial Electronics IEEE Transactions, 58(3), 1052\u20131060.","journal-title":"Industrial Electronics IEEE Transactions"},{"issue":"1","key":"5440_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/72.80311","volume":"2","author":"DN Zhou","year":"1991","unstructured":"Zhou, D. N., Cherkassky, V., Baldwin, T. R., et al. (1991). A neural network approach to job-shop scheduling. IEEE Transactions on Neural Networks, 2(1), 175\u2013179.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"12","key":"5440_CR9","first-page":"486","volume":"21","author":"Y Sun","year":"2009","unstructured":"Sun, Y., & Xiong, H. (2009). Job-shop scheduling problem based on particle swarm optimization algorithm. Information Technology, 21(12), 486\u2013489.","journal-title":"Information Technology"},{"key":"5440_CR10","doi-asserted-by":"crossref","unstructured":"Adewumi, A. O., & Arasomwan, A. M. (2014). Improved particle swarm optimization based on greedy and adaptive features. In IEEE (pp. 237\u2013242).","DOI":"10.1109\/SIS.2014.7011801"},{"key":"5440_CR11","doi-asserted-by":"crossref","unstructured":"Liu, X., Jiao, X., Li, Y., et al. (2013). Improved new particle swarm algorithm solving job shop scheduling optimization problem. In International conference on computer science and network technology, IEEE (pp. 148\u2013150).","DOI":"10.1109\/ICCSNT.2013.6967083"},{"key":"5440_CR12","doi-asserted-by":"crossref","unstructured":"Surekha, P., Raajan, P. M., & Sumathi, S. (2010). Genetic algorithm and particle swarm optimization approaches to solve combinatorial job shop scheduling problems. In IEEE international conference on computational intelligence and computing research, IEEE (pp. 1\u20135).","DOI":"10.1109\/ICCIC.2010.5705759"},{"issue":"2","key":"5440_CR13","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"Z Lian","year":"2006","unstructured":"Lian, Z., Gu, X., & Jiao, B. (2006). A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation, 183(2), 1008\u20131017.","journal-title":"Applied Mathematics and Computation"},{"key":"5440_CR14","unstructured":"Tang, H., & Ye, C. (2011). A hybrid particle swarm optimization for job shop scheduling. In International Conference on Information Management, Innovation Management and Industrial Engineering (Vol. 28, pp. 187\u2013190). IEEE."},{"issue":"4","key":"5440_CR15","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"DY Sha","year":"2006","unstructured":"Sha, D. Y., & Hsu, C. Y. (2006). A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering, 51(4), 791\u2013808.","journal-title":"Computers & Industrial Engineering"},{"key":"5440_CR16","doi-asserted-by":"crossref","unstructured":"Li, J., Pan, Q., Xie, S., et al. (2011). A hybrid algorithm for multi-objective job shop scheduling problem (pp. 3630\u20133634).","DOI":"10.1109\/CCDC.2011.5968852"},{"issue":"2","key":"5440_CR17","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.eswa.2009.06.041","volume":"37","author":"DY Sha","year":"2010","unstructured":"Sha, D. Y., & Lin, H. H. (2010). A multi-objective PSO for job-shop scheduling problems. Expert Systems with Applications An International Journal, 37(2), 1065\u20131070.","journal-title":"Expert Systems with Applications An International Journal"},{"issue":"9","key":"5440_CR18","doi-asserted-by":"publisher","first-page":"10812","DOI":"10.1016\/j.eswa.2011.02.050","volume":"38","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam, R., Azarkish, M., & Sadeghnejad-Barkousaraie, A. (2011). A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem. Expert Systems with Applications An International Journal, 38(9), 10812\u201310821.","journal-title":"Expert Systems with Applications An International Journal"},{"key":"5440_CR19","first-page":"61","volume":"93","author":"R Tavakkoli-Moghaddam","year":"2010","unstructured":"Tavakkoli-Moghaddam, R., Azarkish, M., & Sadeghnejad, A. (2010). A new hybrid multi-objective Pareto archive pSO algorithm for a classic job shop scheduling problem with ready times. Expert Systems with Applications, 93, 61\u201368.","journal-title":"Expert Systems with Applications"},{"key":"5440_CR20","doi-asserted-by":"publisher","unstructured":"Qin, C., Zhu, J., & Zheng, J. (2009). Hybrid evolutionary algorithm for multi-objective job shop scheduling. \n                    https:\/\/doi.org\/10.1109\/ICICISYS.2009.5358297\n                    \n                  .","DOI":"10.1109\/ICICISYS.2009.5358297"},{"issue":"2","key":"5440_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.22452\/mjcs.vol20no2.6","volume":"20","author":"KSN Ripon","year":"2007","unstructured":"Ripon, K. S. N. (2007). Hybrid evolutionary approach for multi-objective job-shop scheduling problem. Malaysian Journal of Computer Science, 20(2), 183\u2013198.","journal-title":"Malaysian Journal of Computer Science"},{"key":"5440_CR22","unstructured":"Lee, K. B., & Kim, J. H. Multi-objective particle swarm optimization with preference-based sorting. In Evolutionary computation, IEEE (pp. 2506\u20132513)."},{"key":"5440_CR23","doi-asserted-by":"crossref","unstructured":"Piroozfard, H., & Wong, K. Y. (2015). Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm. In International conference on mathematics. AIP Publishing LLC (pp. 225\u2013251).","DOI":"10.1063\/1.4915695"},{"key":"5440_CR24","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1023\/B:JIMS.0000034106.86434.46","volume":"15","author":"F Geyik","year":"2004","unstructured":"Geyik, F., & Cedimoglu, I. H. (2004). The Strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing, 15, 439\u2013448.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"5440_CR25","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995) Particle swarm optimization. In IEEE international conference on neural networks, 1995. Proceedings. IEEE Xplore (vol. 4, pp. 1942\u20131948).","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"5440_CR26","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.autcon.2004.08.006","volume":"15","author":"H Zhang","year":"2005","unstructured":"Zhang, H., Li, X., Li, H., et al. (2005). Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construction, 15(3), 393\u2013404.","journal-title":"Automation in Construction"},{"key":"5440_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-981-10-2666-9_8","volume-title":"Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems","author":"Qiaofeng Meng","year":"2016","unstructured":"Meng, Q., Zhang, L., & Fan, Y. (2016). A hybrid particle swarm optimization algorithm for solving job shop scheduling problems. In Asian Simulation Conference (pp. 71\u201378). Singapore: Springer."},{"key":"5440_CR28","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2005","unstructured":"Montgomery, D. C. (2005). Design and analysis of experiments. Arizona: John Wiley & Sons."},{"issue":"11","key":"5440_CR29","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"5440_CR30","unstructured":"Hu, N., & Wang, P. (2011). An algorithm for solving flexible job shop scheduling problems based on multi-objective particle swarm optimization. In International symposium on information science and engineering, IEEE (pp. 507\u2013511)."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-018-5440-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5440-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5440-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T01:04:14Z","timestamp":1549501454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-018-5440-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["5440"],"URL":"https:\/\/doi.org\/10.1007\/s11277-018-5440-z","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2018,2,7]]},"assertion":[{"value":"7 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}