{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T02:34:21Z","timestamp":1774492461220,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T00:00:00Z","timestamp":1387238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00500-013-1199-z","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T10:55:04Z","timestamp":1387191304000},"page":"2271-2282","source":"Crossref","is-referenced-by-count":19,"title":["A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Chun-Lung","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Ying","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeu-Ruey","family":"Tzeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuen-Lung","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,17]]},"reference":[{"key":"1199_CR1","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.cor.2011.08.016","volume":"39","author":"S-H Chen","year":"2012","unstructured":"Chen S-H, Chang P-C, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39:1450\u20131457","journal-title":"Comput Oper Res"},{"key":"1199_CR2","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT, Cambridge","DOI":"10.1007\/b99492"},{"key":"1199_CR3","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1057\/palgrave.jors.2601766","volume":"55","author":"O Etiler","year":"2004","unstructured":"Etiler O, Toklu B, Atak M, Wilson J (2004) A genetic algorithm for flow shop scheduling problems. J Oper Res Soc 55:830\u2013835","journal-title":"J Oper Res Soc"},{"key":"1199_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"1199_CR5","unstructured":"Glover F (1996) Tabu search and adaptive memory programming\u2013advances. Applications and challenges. Kluwer, Boston, pp 1\u201375"},{"key":"1199_CR6","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion. Comput Oper Res 31:1891\u20131909","journal-title":"Comput Oper Res"},{"key":"1199_CR7","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.cie.2007.09.006","volume":"54","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Ibrahim S, Siarry P, Abdelwaheb R (2008) A combinatorial particle swarm optimization for solving permutation flowshop problems. Comput Ind Eng 54:526\u2013538","journal-title":"Comput Ind Eng"},{"key":"1199_CR8","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization Proc AESF Annu Tech Conf 1995 IEEE Int Conf. Neural Netw 4:1942\u20131948","journal-title":"Neural Netw"},{"key":"1199_CR9","doi-asserted-by":"crossref","unstructured":"Kuoa IH, Horng SJ, Kaod TW, Lina TL, Lee CL, Terano T, Pan Y (2009) An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Syst Appl 36:7027\u20137032","DOI":"10.1016\/j.eswa.2008.08.054"},{"key":"1199_CR10","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"Z Lian","year":"2008","unstructured":"Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Soliton Fract 35:851\u2013861","journal-title":"Chaos Soliton Fract"},{"key":"1199_CR11","doi-asserted-by":"crossref","unstructured":"Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput. doi: 10.1007\/s00500-013-0992-z","DOI":"10.1007\/s00500-013-0992-z"},{"key":"1199_CR12","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30:1061\u20131071","journal-title":"Comput Ind Eng"},{"key":"1199_CR13","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E Nowicki","year":"2006","unstructured":"Nowicki E, Smutnicki C (2006) Some aspects of scatter search in the flow-shop problem. Eur J Oper Res 169:654\u2013666","journal-title":"Eur J Oper Res"},{"key":"1199_CR14","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flowshop problem. Eur J Oper Res 91:160\u2013175","journal-title":"Eur J Oper Res"},{"key":"1199_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"FA Ogbu","year":"1990","unstructured":"Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flow shop problem. Comput Oper Res 17:243\u2013253","journal-title":"Comput Oper Res"},{"key":"1199_CR16","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I Osman","year":"1989","unstructured":"Osman I, Potts C (1989) Simulated annealing for permutation flow shop scheduling. OMEGA 17:551\u2013557","journal-title":"OMEGA"},{"key":"1199_CR17","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008a) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807\u20132839","journal-title":"Comput Oper Res"},{"key":"1199_CR18","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008b) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng 55:795\u2013816","journal-title":"Comput Ind Eng"},{"key":"1199_CR19","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"12","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Tasgetiren MF, Suganthan PN, Chua T-J (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 12:2455\u20132468","journal-title":"Inf Sci"},{"key":"1199_CR20","doi-asserted-by":"crossref","unstructured":"Ponnambalm SG, Jawahar N, Chandrasekaran S (2009) Discrete particle swarm optimization algorithm for flowshop scheduling. In: Lazinica A (ed) Particle swarm optimization. InTech, Vienna","DOI":"10.5772\/6762"},{"key":"1199_CR21","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur J Oper Res 155:426\u2013438","journal-title":"Eur J Oper Res"},{"key":"1199_CR22","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/11539902_70","volume":"3612","author":"K Rameshkumar","year":"2005","unstructured":"Rameshkumar K, Suresh RK, Mohanasundaram KM (2005) Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. Lect Notes Comput Sci 3612:572\u2013581","journal-title":"Lect Notes Comput Sci"},{"key":"1199_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5\u201313","journal-title":"Comput Oper Res"},{"key":"1199_CR24","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033\u20132049","journal-title":"Eur J Oper Res"},{"key":"1199_CR25","unstructured":"Sipper D, Bulfin R (1997) Production: planning, control, and integration. The McGraw-Hill, New York"},{"key":"1199_CR26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65\u201374","journal-title":"Eur J Oper Res"},{"key":"1199_CR27","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285","journal-title":"Eur J Oper Res"},{"key":"1199_CR28","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177:1930\u20131947","journal-title":"Eur J Oper Res"},{"key":"1199_CR29","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput 12:652\u2013662","journal-title":"Appl Soft Comput"},{"key":"1199_CR30","doi-asserted-by":"crossref","first-page":"4515","DOI":"10.1016\/j.ins.2010.07.013","volume":"181","author":"Y Wang","year":"2011","unstructured":"Wang Y, Li B, Weise T, Wang J, Yuan B, Tian Q (2011) Self-adaptive learning based particle swarm optimization. Inf Sci 181:4515\u20134538","journal-title":"Inf Sci"},{"key":"1199_CR31","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"K-C Ying","year":"2004","unstructured":"Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31:791\u2013801","journal-title":"Comput Oper Res"},{"key":"1199_CR32","doi-asserted-by":"crossref","unstructured":"Zhang C, Jiaxu N, Dantong O (2010a) A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput Ind Eng 58:1\u201311","DOI":"10.1016\/j.cie.2009.01.016"},{"key":"1199_CR33","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhang C, Liang S (2010b) The circular discrete particle swarm optimization algorithm for flow shop scheduling problem. Expert Syst Appl 37:5827\u20135834","DOI":"10.1016\/j.eswa.2010.02.024"},{"key":"1199_CR34","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.amc.2005.07.042","volume":"175","author":"L Zhigang","year":"2006","unstructured":"Zhigang L, Xingsheng G, Bin J (2006) A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Appl Math Comput 175:773\u2013785","journal-title":"Appl Math Comput"},{"key":"1199_CR35","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"GI Zobolas","year":"2009","unstructured":"Zobolas GI, Tarantilis CD, Ioannou G (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res 36:1249\u20131267","journal-title":"Comput Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1199-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1199-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1199-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:36Z","timestamp":1559094216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1199-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,17]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1199"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1199-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,17]]}}}