{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:30:26Z","timestamp":1743096626806,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914459"},{"type":"electronic","value":"9783319914466"}],"license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-91446-6_8","type":"book-chapter","created":{"date-parts":[[2018,5,26]],"date-time":"2018-05-26T00:54:03Z","timestamp":1527296043000},"page":"74-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Meta-heuristic Task Scheduling Algorithm for Computing Cluster with 2D Packing Problem Approach"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Bo\u017cejko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zenon","family":"Chaczko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Nadybski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1080\/05695557008974759","volume":"2","author":"G Bozoki","year":"1970","unstructured":"Bozoki, G., Richard, J.-P.: A branch-and-bound algorithm for the continous-process job-shop scheduling problem. AIIE Trans. 2(3), 246\u2013252 (1970)","journal-title":"AIIE Trans."},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"35","author":"J B\u0142a\u017cewicz","year":"1986","unstructured":"B\u0142a\u017cewicz, J., Drabowski, M., W\u0119glarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. 35(5), 389\u2013393 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-015-0427-z","volume":"18","author":"I B\u0142\u0105dek","year":"2015","unstructured":"B\u0142\u0105dek, I., Drozdowski, M., Guinand, F., Schepler, X.: On contiguous and non-contiguous parallel task scheduling. J. Sched. 18(5), 487\u2013495 (2015)","journal-title":"J. Sched."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2015.01.004","volume":"81","author":"W Bo\u017cejko","year":"2015","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158\u2013166 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"8_CR5","unstructured":"Bo\u017cejko, W., Nadybski, P., Wodecki, M.: Scheduling tasks for a computing cluster. In: Knosala, R. (ed.) Innovation in Management and Production Engineering, pp. 524\u2013533. Publishing House of the Polish Society for Production Management (2017). ISBN 978-83-941281-1-1"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-45378-1_27","volume-title":"Computer Information Systems and Industrial Management","author":"Wojciech Bo\u017cejko","year":"2016","unstructured":"Bo\u017cejko, W., Kacprzak, L., Nadybski, P., Wodecki, M.: Multi-machine scheduling with setup times. In: Proceedings of the Computer Information Systems and Industrial Management - 15th International Conference, CISIM 2016, Vilnius, Lithuania, 14\u201316 September 2016. LNCS, vol. 9842, 300\u2013311. Springer (2016)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-45378-1_28","volume-title":"Computer Information Systems and Industrial Management","author":"Wojciech Bo\u017cejko","year":"2016","unstructured":"Bo\u017cejko, W., Nadybski, P., Wodecki, M.: Two step algorithm for virtual machine distributed replication with limited bandwidth problem. In: Proceedings of the Computer Information Systems and Industrial Management - 15th International Conference, CISIM 2016, Vilnius, Lithuania, 14\u201316 September 2016. LNCS, vol. 9842, 312\u2013321. Springer (2016)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"3789","DOI":"10.1109\/EMEIT.2011.6023883","volume":"7","author":"D Cao","year":"2011","unstructured":"Cao, D., Kotov, V.M.: A best-fit heuristic algorithm for two dimensional bin packing problem. Electr. Mech. Eng. Inf. Technol. (EMEIT) 7, 3789\u20133791 (2011)","journal-title":"Electr. Mech. Eng. Inf. Technol. (EMEIT)"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for Parallel Processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Springer, London (2009)"},{"key":"8_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search. Part I. ORSA J. Comput. 1, 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"T Imamichi","year":"2009","unstructured":"Imamichi, T., Kenmochi, M., Nonobe, K., Nagamochi, H., Yagiura, M.: Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1), 73\u201383 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123, 379\u2013396 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0898-1221(94)00129-4","volume":"28","author":"JF Lin","year":"1994","unstructured":"Lin, J.F., Chen, S.J.: Scheduling algorithm for nonpreemptive multiprocessor tasks. Comput. Math. Appl. 28(4), 85\u201392 (1994)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"E Lloyd","year":"1981","unstructured":"Lloyd, E.: Concurrent task systems. Oper. Res. 29(1), 189\u2013201 (1981)","journal-title":"Oper. Res."},{"key":"8_CR16","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy, March 2001"},{"issue":"1\u20133","key":"8_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1\u20133), 379\u2013396 (2002)","journal-title":"Discret. Appl. Math."},{"key":"8_CR18","unstructured":"Pietrobuoni, E.: Two-dimensional bin packing problem with Guillotine restrictions, Ph.D., Universit\u2018a di Bologna (2015)"},{"key":"8_CR19","first-page":"128","volume":"1","author":"V Vizing","year":"1981","unstructured":"Vizing, V.: About schedules observing deadlines. Kibernetika 1, 128\u2013135 (1981)","journal-title":"Kibernetika"},{"issue":"9\u201310","key":"8_CR20","first-page":"996","volume":"37","author":"M Wodecki","year":"2007","unstructured":"Wodecki, M.: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. J. Adv. Manuf. Technol. 37(9\u201310), 996\u20131004 (2007)","journal-title":"J. Adv. Manuf. Technol."}],"container-title":["Advances in Intelligent Systems and Computing","Contemporary Complex Systems and Their Dependability"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91446-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T06:15:53Z","timestamp":1529993753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91446-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"ISBN":["9783319914459","9783319914466"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91446-6_8","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,5,27]]}}}