{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:42:00Z","timestamp":1725622920000},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408031"},{"type":"electronic","value":"9783540452249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45224-9_40","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:09:45Z","timestamp":1294394985000},"page":"279-286","source":"Crossref","is-referenced-by-count":7,"title":["Population-Based Approach to Multiprocessor Task Scheduling in Multistage Hybrid Flowshops"],"prefix":"10.1007","author":[{"given":"Joanna","family":"J\u0119drzejowicz","sequence":"first","affiliation":[]},{"given":"Piotr","family":"J\u0119drzejowicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0020-0190(84)90006-1","volume":"18","author":"J. Bla\u017cewicz","year":"1984","unstructured":"Bla\u017cewicz, J., Drozdowski, M., W\u0119glarz, J.: Scheduling independent 2-processor tasks to minimize schedule length. Information Processing Letters\u00a018, 267\u2013273 (1984)","journal-title":"Information Processing Letters"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TC.1986.1676665","volume":"C-35","author":"J. Bla\u017cewicz","year":"1986","unstructured":"Bla\u017cewicz, J., Drozdowski, M., W\u0119glarz, J.: Scheduling multiprocessor tasks to minimize schedule length. EEE Transactions on Computers\u00a0C-35, 81\u201396 (1986)","journal-title":"EEE Transactions on Computers"},{"key":"40_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Bla\u017cewicz","year":"1996","unstructured":"Bla\u017cewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., W\u0119glarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Berlin (1996)"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"E.L. Lloyd","year":"1981","unstructured":"Lloyd, E.L.: Concurrent task systems. Operations Research\u00a029, 189\u2013201 (1981)","journal-title":"Operations Research"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02099688","volume":"50","author":"P. Brucker","year":"1995","unstructured":"Brucker, P., Kramer, B.: Shop Scheduling Problems with multiprocessor tasks on dedicated processors. Annals of Operations Research\u00a050, 13\u201327 (1995)","journal-title":"Annals of Operations Research"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for computationally difficult set covering problems. Operations Research Letters\u00a08, 706\u2013712 (1989)","journal-title":"Operations Research Letters"},{"key":"40_CR7","first-page":"51","volume":"24","author":"P. J\u0119drzejowicz","year":"1999","unstructured":"J\u0119drzejowicz, P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems. Foundation of Computing and Decision Sciences\u00a024, 51\u201366 (1999)","journal-title":"Foundation of Computing and Decision Sciences"},{"key":"40_CR8","first-page":"93","volume-title":"Knowledge-based Intelligent Information Engineering Systems and Allied Technologies","author":"J. J\u0119drzejowicz","year":"2002","unstructured":"J\u0119drzejowicz, J., J\u0119drzejowicz, P.: Permutation Scheduling Using Population Learning Algorithm. In: Damiani, E., et al. (eds.) Knowledge-based Intelligent Information Engineering Systems and Allied Technologies, pp. 93\u201397. IOS Press, Amsterdam (2002)"},{"key":"40_CR9","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic Algorithms: A short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 219\u2013234. McGraw-Hill, New York (1999)"},{"key":"40_CR10","unstructured":"O\u01e7uz, C., Zinder, Y., Ha Do, V., Janiak, A., Lichtenstein, M.: Hybrid flow-shop scheduling problems with multiprocessor task systems. Working paper, The Hong Kong Polytechnic University, Hong Kong SAR (2001)"},{"key":"40_CR11","first-page":"131","volume-title":"Proceedings of the Third Annual Conference on Evolutionary Programming","author":"R.G. Reynolds","year":"1994","unstructured":"Reynolds, R.G.: An Introduction to Cultural Algorithms. In: Sebald, A.V., Fogel, L.J. (eds.) Proceedings of the Third Annual Conference on Evolutionary Programming, pp. 131\u2013139. World Scientific, River Edge (1994)"},{"key":"40_CR12","unstructured":"Sivrikaya-\u015eerifo\u01e7lu, F., Ulusoy, G.: A genetic algorithm for multiprocessor task scheduling in multistage hybrid flowshops. Working paper, Abant Izzet Baysal University, Bolu (2001)"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45224-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:09:06Z","timestamp":1558721346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45224-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408031","9783540452249"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45224-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}