{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:58:01Z","timestamp":1725897481802},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642134944"},{"type":"electronic","value":"9783642134951"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13495-1_16","type":"book-chapter","created":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T18:47:10Z","timestamp":1275936430000},"page":"128-134","source":"Crossref","is-referenced-by-count":3,"title":["A Novel Encoding Scheme of PSO for Two-Machine Group Scheduling"],"prefix":"10.1007","author":[{"given":"Cheng-Dar","family":"Liou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Hung","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.D. Garey","year":"1976","unstructured":"Garey, M.D., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res.\u00a01(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","volume":"125","author":"J.E. Schaller","year":"2000","unstructured":"Schaller, J.E., Gupta, J.N.D., Vakharia, A.J.: Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur. J. Oper. Res.\u00a0125, 324\u2013339 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cor.2004.07.004","volume":"33","author":"R. Logendran","year":"2006","unstructured":"Logendran, R., Salmasi, N., Sriskandarajah, C.: Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups. Comp. Oper. Res.\u00a033, 158\u2013180 (2006)","journal-title":"Comp. Oper. Res."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Piscataway, NJ, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"16_CR5","first-page":"1","volume":"12","author":"P.L. Maggu","year":"1980","unstructured":"Maggu, P.L., Das, G.: On sequencing problem with transportation times of jobs. Pure A. Math.\u00a012, 1\u20136 (1980)","journal-title":"Pure A. Math."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/S0305-0548(99)00070-2","volume":"27","author":"D.L. Yang","year":"1999","unstructured":"Yang, D.L., Chern, M.S.: Two-machine flowshop group scheduling problem. Comp. Oper. Res.\u00a027, 975\u2013985 (1999)","journal-title":"Comp. Oper. Res."},{"issue":"2","key":"16_CR7","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 algorithms and random keys for sequencing and optimization. ORSA J. Comp.\u00a06(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comp."},{"issue":"9","key":"16_CR8","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B. Liu","year":"2008","unstructured":"Liu, B., Wang, L., Jin, Y.H.: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Comp. Oper. Res.\u00a035(9), 2791\u20132806 (2008)","journal-title":"Comp. Oper. Res."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cor.2009.04.013","volume":"37","author":"S. Nasser","year":"2010","unstructured":"Nasser, S., Rasaratnam, L., Mohammad, R.S.: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comp. Oper. Res.\u00a037(1), 199\u2013212 (2010)","journal-title":"Comp. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13495-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:04:55Z","timestamp":1619769895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13495-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642134944","9783642134951"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13495-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}