{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:53:52Z","timestamp":1772297632076,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540733225","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73325-6_30","type":"book-chapter","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T04:05:23Z","timestamp":1184645123000},"page":"303-312","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Flow-Shop Scheduling Algorithm Based on a Hybrid Particle Swarm Optimization Model"],"prefix":"10.1007","author":[{"given":"I-Hong","family":"Kuo","sequence":"first","affiliation":[]},{"given":"Shi-Jinn","family":"Horng","sequence":"additional","affiliation":[]},{"given":"Tzong-Wann","family":"Kao","sequence":"additional","affiliation":[]},{"given":"Tsung-Lieh","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Pingzhi","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Lian, Z., Gu, X., Jiao, B.: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Solitons and Fractals (In Press, Corrected Proof)","DOI":"10.1016\/j.chaos.2006.05.082"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 117\u2013129 (1976)","DOI":"10.1287\/moor.1.2.117"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 61\u201368 (1954)","DOI":"10.1002\/nav.3800010110"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Palmer, D.: Sequencing jobs through a multi-stage procrss in the minimun total time- a quick method of obtaining a near optimun. Operational Research Quarterly, 101\u2013107 (1965)","DOI":"10.1057\/jors.1965.8"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science, 630\u2013637 (1970)","DOI":"10.1287\/mnsc.16.10.B630"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA, 91\u201395 (1983)","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Taillard, E.: Some efficient heuristic methods for the flow shop scheduling problem. European Journal of Operational Research, 65\u201374 (1990)","DOI":"10.1016\/0377-2217(90)90090-X"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Ogbu, F.A., Smith, D.K.: The application of the simulated annealing algorithm to the solution of the n\/m\/cmax flow shop problem. Computers and Operations Research, 243\u2013253 (1990)","DOI":"10.1016\/0305-0548(90)90001-N"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Reeves, C.R.: A genetic algorithm for flow shop sequencing. Computer Operational Research, 5\u201313 (1995)","DOI":"10.1016\/0305-0548(93)E0014-K"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of IEEE international Conference on Neural Network","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE international Conference on Neural Network, pp. 1942\u20131948. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the Congress on Evolutionary Computation, pp. 1945\u20131950 (1999)","DOI":"10.1109\/CEC.1999.785511"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 240\u2013255 (2004)","DOI":"10.1109\/TEVC.2004.826071"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research, 278\u2013285 (1993)","DOI":"10.1016\/0377-2217(93)90182-M"}],"container-title":["Lecture Notes in Computer Science","New Trends in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73325-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:13:35Z","timestamp":1605762815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73325-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733225"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73325-6_30","relation":{},"subject":[]}}