{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T08:27:52Z","timestamp":1778833672883,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226727","type":"print"},{"value":"9783540286462","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28646-2_38","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:30:21Z","timestamp":1285083021000},"page":"382-389","source":"Crossref","is-referenced-by-count":86,"title":["Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem"],"prefix":"10.1007","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Sevkli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun-Chia","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunes","family":"Gencyilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0142-0615(01)00067-9","volume":"24","author":"M.A. Abido","year":"2002","unstructured":"Abido, M.A.: Optimal power flow using particle swarm optimization. Electrical Power and Energy Systems\u00a024, 563\u2013571 (2002)","journal-title":"Electrical Power and Energy Systems"},{"issue":"2","key":"38_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA journal on computing\u00a06(2), 154\u2013160 (1994)","journal-title":"ORSA journal on computing"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39\u201343 (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"J.M. Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega\u00a031, 311\u2013317 (2003)","journal-title":"Omega"},{"issue":"11","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J. Grabowski","year":"2004","unstructured":"Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion. Computers and Operations Research\u00a031(11), 1891\u20131909 (2004)","journal-title":"Computers and Operations Research"},{"key":"38_CR6","unstructured":"Hu, X., Eberhard, R.C., Shi, Y.: Swarm Intelligence for Permutation optimization: A case study of n-Queens problem. In: Proc. of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis, IN, pp. 243\u2013246 (2003)"},{"key":"38_CR7","volume-title":"Swarm intelligence","author":"J. Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan Kaufmann, San Mateo (2001)"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"38_CR9","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 Jr, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega\u00a011(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1080\/00207540310001614150","volume":"42","author":"G.C. Onwubolu","year":"2004","unstructured":"Onwubolu, G.C., Clerc, M.: Optimal operating path for automated drilling operations by a new heuristic approach using particle swarm optimisation. International Journal of Production Research\u00a042(3), 473\u2013491 (2004)","journal-title":"International Journal of Production Research"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flowshop problem. European Journal of Operational Research\u00a091, 160\u2013175 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"38_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. Osman","year":"1989","unstructured":"Osman, I., Potts, C.: Simulated annealing for permutation flow shop scheduling. Omega\u00a017(6), 551\u2013557 (1989)","journal-title":"Omega"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C. Reeves","year":"1998","unstructured":"Reeves, C., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation\u00a06, 45\u201360 (1998)","journal-title":"Evolutionary Computation"},{"key":"38_CR14","unstructured":"Rinnooy Kan, A.H.G.: Machine scheduling problems: Classification, complexity and computations, Nijhoff, The Hague (1976)"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A. Salman","year":"2003","unstructured":"Salman, A., Ahmad, I., Al-Madani, S.: Particle swarm optimization for task assignment problem. Microprocessors and Microsystems\u00a026, 363\u2013371 (2003)","journal-title":"Microprocessors and Microsystems"},{"key":"38_CR16","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flowshop problem, Technical Report, AIDA-98-04, Darmstad University of Technology, Darmstad, Germany (1998)"},{"key":"38_CR17","unstructured":"St\u00fctzle, T.: An ant approach to the flowshop problem. In: Proc. of EUFIT 1998, pp. 1560\u20131564 (1998)"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"38_CR19","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proc. of the 2004 Congress on Evolutionary Computation (2004) (to appear)"},{"issue":"2","key":"38_CR20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","volume":"14","author":"J.P. Watson","year":"2002","unstructured":"Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.: Contrasting structured and Random Permutation Flowshop Scheduling Problems: Search space Topology and Algorithm Performance. ORSA Journal of Computing\u00a014(2), 98\u2013123 (2002)","journal-title":"ORSA Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28646-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:13:01Z","timestamp":1778249581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-28646-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226727","9783540286462"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28646-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}