{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:00:32Z","timestamp":1760608832859,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2015,2,4]],"date-time":"2015-02-04T00:00:00Z","timestamp":1423008000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the proposed algorithm has a powerful search capability in solving the flexible job shop scheduling problem compared with other heuristic algorithms, such as the genetic algorithm, tabu search and ant colony optimization. Moreover, the results also show that the improved strategies could improve the performance of the algorithm effectively.<\/jats:p>","DOI":"10.3390\/a8010019","type":"journal-article","created":{"date-parts":[[2015,2,4]],"date-time":"2015-02-04T08:25:00Z","timestamp":1423038300000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem"],"prefix":"10.3390","volume":"8","author":[{"given":"Kong","family":"Lu","sequence":"first","affiliation":[{"name":"Transportation Management College, Dalian Maritime University, Dalian 116026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Ting","sequence":"additional","affiliation":[{"name":"Transportation Management College, Dalian Maritime University, Dalian 116026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Keming","sequence":"additional","affiliation":[{"name":"Transportation Management College, Dalian Maritime University, Dalian 116026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Hanbing","sequence":"additional","affiliation":[{"name":"Transportation Management College, Dalian Maritime University, Dalian 116026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takano","family":"Makoto","sequence":"additional","affiliation":[{"name":"Department of transportation Engineering, Indian Institute of Technology, Kharagpur 721302, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Bin","sequence":"additional","affiliation":[{"name":"Traffic and transportation college, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,2,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of f1owshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.trc.2013.12.005","article-title":"Transit network design based on travel time reliability","volume":"43","author":"Yao","year":"2014a","journal-title":"Transp. Res. Part C"},{"key":"ref_3","first-page":"1309","article-title":"Improved support vector machine regression in multi-step-ahead prediction for rock displacement surrounding a tunnel","volume":"21","author":"Yao","year":"2014b","journal-title":"Scientia Iranica."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.2478\/amcs-2014-0030","article-title":"A Support Vector Machine with the Tabu Search Algorithm For Freeway Incident Detection","volume":"24","author":"Yao","year":"2014c","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","article-title":"An Improved Ant Colony Optimization for Vehicle Routing Problem","volume":"196","author":"Yu","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","article-title":"An ant colony optimization model: The period vehicle routing problem with time windows","volume":"47","author":"Yu","year":"2011","journal-title":"Transp. Res. Part E"},{"key":"ref_7","first-page":"1265","article-title":"Real-Time Partway Deadheading Strategy Based on Transit Service Reliability Assessment","volume":"46","author":"Yu","year":"2012a","journal-title":"Transp. Res. Part A"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.trc.2011.12.003","article-title":"Transit route network design-maximizing direct and transfer demand density","volume":"22","author":"Yu","year":"2012b","journal-title":"Transp. Res. Part C"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.1166\/asl.2011.1601","article-title":"An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problems","volume":"4","author":"Yao","year":"2011","journal-title":"Adv. Sci. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"4083","DOI":"10.1103\/PhysRevLett.71.4083","article-title":"Punctuated equilibrium and criticality in a simple model of evolution","volume":"71","author":"Bak","year":"1993","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems","volume":"35","author":"Gao","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","article-title":"Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm","volume":"129","author":"Eusuff","year":"2003","journal-title":"J. Water Resour. Plan. Manag."},{"key":"ref_14","unstructured":"Kennedy, J., and Eberhart, R. Particle Swarm Optimization, Perth, Australia."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1007\/s00170-008-1558-6","article-title":"A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem","volume":"41","author":"Alireza","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Bhaduri, A. (2009, January 27\u201328). Color image segmentation using clonal selection-based shuffled frog leaping algorithm, Kottayam, India.","DOI":"10.1109\/ARTCom.2009.115"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s00170-009-1958-2","article-title":"Application of shuffled frog-leaping algorithm on clustering","volume":"45","author":"Babak","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ins.2010.07.016","article-title":"An improved shuffled frog-leaping algorithm with extremal optimization for continuous optimization","volume":"192","author":"Li","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"429","DOI":"10.3724\/SP.J.1146.2010.00328","article-title":"Improved Shuffled Frog Leaping Algorithm for Solving CVRP","volume":"33","author":"Luo","year":"2011","journal-title":"J. Electr. Inf. Technol."},{"key":"ref_20","unstructured":"Boettcher, S., and Percus, A.G. (1999, January 13). Extremal Optimization: Methods derived from Co-Evolution, New York, NY, USA."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","article-title":"An Artificial Immune Algorithm for The Flexible Job-Shop Scheduling Problem","volume":"26","author":"Bagheri","year":"2010","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1140\/epjb\/e2005-00280-6","article-title":"Extremal Optimization for the Sherrington-Kirkpatrick Spin Glass","volume":"46","author":"Boettcher","year":"2005","journal-title":"Eur. Phys. J. B"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.ejor.2007.05.008","article-title":"A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization","volume":"188","author":"Chen","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cie.2007.06.007","article-title":"A hybrid multi-object shuffled frog leaping algorithm for a mixed-model assembly line sequencing problem","volume":"53","author":"Alireza","year":"2007","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Luo, X.H., Yang, Y., and Li, X. (2008, January 26\u201328). Solving TSP with shuffled frog-leaping algorithm, Kaohsiung, Taiwan.","DOI":"10.1109\/ISDA.2008.346"},{"key":"ref_26","unstructured":"Wang, C.R., Zhang, J.W., Yang, J., and Hu, C. (2005, January 13\u201315). A modified particle swarm optimization algorithm and its application for solving traveling salesman problem, Beijing, China."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and Scheduling in a Flexible Job Shop by Taboo Search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective Neighbourhood Functions for the Flexible Job Shop Problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"J. Sched."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/8\/1\/19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:42:22Z","timestamp":1760215342000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/8\/1\/19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,4]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,3]]}},"alternative-id":["a8010019"],"URL":"https:\/\/doi.org\/10.3390\/a8010019","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2015,2,4]]}}}