{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:38:39Z","timestamp":1772836719702,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T00:00:00Z","timestamp":1427155200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10951-015-0427-z","type":"journal-article","created":{"date-parts":[[2015,3,23]],"date-time":"2015-03-23T12:26:25Z","timestamp":1427113585000},"page":"487-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On contiguous and non-contiguous parallel task scheduling"],"prefix":"10.1007","volume":"18","author":[{"given":"Iwo","family":"B\u0142\u0105dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Drozdowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Guinand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Schepler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,24]]},"reference":[{"issue":"2","key":"427_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00453-001-0076-9","volume":"32","author":"AK Amoura","year":"2002","unstructured":"Amoura, A. K., Bampis, E., Kenyon, C., & Manoussakis, Y. (2002). Scheduling independent multiprocessor tasks. Algorithmica, 32(2), 247\u2013261.","journal-title":"Algorithmica"},{"key":"427_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10479-007-0282-1","volume":"159","author":"F Baille","year":"2008","unstructured":"Baille, F., Bampis, E., Laforest, C., & Rapine, C. (2008). Bicriteria scheduling for contiguous and non contiguous parallel tasks. Annals of Operations Research, 159, 97\u2013106.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"427_CR3","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C Bierwirth","year":"2010","unstructured":"Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615\u2013627.","journal-title":"European Journal of Operational Research"},{"key":"427_CR4","unstructured":"B\u0142\u0105dek, I., Drozdowski, M., Guinand, F., & Schepler, X. (2013). On contiguous and non-contiguous parallel task scheduling, Research Report RA-6\/2013. Institute of Computing Science: Pozna\u0144 University of Technology. http:\/\/www.cs.put.poznan.pl\/mdrozdowski\/rapIIn\/RA-06-13.pdf ."},{"issue":"2","key":"427_CR5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/4434.588296","volume":"5","author":"SH Bokhari","year":"1997","unstructured":"Bokhari, S. H., & Nicol, D. M. (1997). Balancing contention and synchronization on the Intel Paragon. IEEE Concurrency, 5(2), 74\u201383.","journal-title":"IEEE Concurrency"},{"key":"427_CR6","doi-asserted-by":"crossref","unstructured":"Bunde, D.P., Leung, V.J., Mache, J. (2004). Communication patterns and allocation strategies. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS\u201904). (p. 248b).","DOI":"10.1109\/IPDPS.2004.1303307"},{"issue":"12","key":"427_CR7","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1109\/TC.1987.5009493","volume":"36","author":"M-S Chen","year":"1987","unstructured":"Chen, M.-S., & Shin, K. G. (1987). Processor allocation in an n-cube multiprocessor using Gray codes. IEEE Transactions on Computers, 36(12), 1396\u20131407.","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"427_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/367297.367317","volume":"3","author":"EF Codd","year":"1960","unstructured":"Codd, E. F. (1960). Multiprogram scheduling: Parts 1 and 2. Introduction and theory. Communications of the ACM, 3(6), 347\u2013350.","journal-title":"Communications of the ACM"},{"key":"427_CR9","doi-asserted-by":"crossref","unstructured":"Coffman, E. G., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808\u2013826.","DOI":"10.1137\/0209062"},{"key":"427_CR10","doi-asserted-by":"crossref","unstructured":"Drozdowski, M. (2009). Scheduling for parallel processing. London: Springer.","DOI":"10.1007\/978-1-84882-310-5"},{"key":"427_CR11","first-page":"26.1","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"PF Dutot","year":"2004","unstructured":"Dutot, P. F., Mouni\u00e9, G., & Trystram, D. (2004). Scheduling parallel tasks: Approximation algorithms. In J. Y. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis (pp. 26.1\u201326.24). Boca Raton: CRC Press."},{"key":"427_CR12","doi-asserted-by":"crossref","unstructured":"Feitelson, D. G., Rudolph, L., Schwiegelshohn, U., Sevcik, K., & Wong, P. (1997). Theory and practice in parallel job scheduling. In D. G. Feitelson & L. Rudolph (Eds.), Job scheduling strategies for parallel processing. LNCS volume 1291 (pp. 1\u201334). Berlin: Springer.","DOI":"10.1007\/3-540-63574-2_14"},{"key":"427_CR13","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. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"issue":"2","key":"427_CR14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R Harren","year":"2014","unstructured":"Harren, R., Jansen, K., Pradel, L., & van Stee, R. (2014). A (5\/3+ $$\\varepsilon $$ \u03b5 )-approximation for strip packing. Computational Geometry, 47(2), 248\u2013267.","journal-title":"Computational Geometry"},{"issue":"4","key":"427_CR15","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C Kenyon","year":"2000","unstructured":"Kenyon, C., & R\u00e9mila, E. (2000). A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4), 645\u2013656.","journal-title":"Mathematics of Operations Research"},{"key":"427_CR16","doi-asserted-by":"crossref","unstructured":"Leung, V.J., Arkin, E.M., Bender, M.A., Bunde, D., Johnston, J., Lal, A., Mitchell, J.S.B., Phillips, C., Seiden, S. (2002). Processor allocation on Cplant: Achieving general processor locality using one-dimensional allocation strategies. Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER\u201902) (pp. 296\u2013304).","DOI":"10.1109\/CLUSTR.2002.1137758"},{"issue":"4","key":"427_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/71.97898","volume":"2","author":"K Li","year":"1991","unstructured":"Li, K., & Cheng, K.-H. (1991). Job scheduling in a partitionable mesh using a two-dimensional buddy system partitioning scheme. IEEE Transactions on Parallel and Distributed Systems, 2(4), 413\u2013423.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2\u20133","key":"427_CR18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim, A. (1998). The berth planning problem. Operations Research Letters, 22(2\u20133), 105\u2013110.","journal-title":"Operations Research Letters"},{"issue":"1","key":"427_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"EL Lloyd","year":"1981","unstructured":"Lloyd, E. L. (1981). Concurrent task systems. Operations Research, 29(1), 189\u2013201.","journal-title":"Operations Research"},{"issue":"7","key":"427_CR20","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/71.598346","volume":"8","author":"V Lo","year":"1997","unstructured":"Lo, V., Windisch, K. J., Liu, W., & Nitzberg, B. (1997). Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Systems, 8(7), 712\u2013726.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"427_CR21","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.disopt.2008.11.002","volume":"6","author":"N Ntene","year":"2009","unstructured":"Ntene, N., & van Vuuren, J. H. (2009). A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discrete Optimization, 6(2), 174\u2013188.","journal-title":"Discrete Optimization"},{"issue":"2","key":"427_CR22","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A Steinberg","year":"1997","unstructured":"Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401\u2013409.","journal-title":"SIAM Journal on Computing"},{"key":"427_CR23","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J.L., Yu, P.S. (1992). Approximate algorithms for scheduling parallelizable tasks. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201992). (pp. 323\u2013332). ACM.","DOI":"10.1145\/140901.141909"},{"key":"427_CR24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B Veltman","year":"1990","unstructured":"Veltman, B., Lageweg, B. J., & Lenstra, J. K. (1990). Multiprocessor scheduling with communications delays. Parallel Computing, 16, 173\u2013182.","journal-title":"Parallel Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0427-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0427-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0427-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:14:00Z","timestamp":1553642040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0427-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,24]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0427-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,24]]}}}