{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:42:59Z","timestamp":1770745379415,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10951-006-5593-6","type":"journal-article","created":{"date-parts":[[2006,1,9]],"date-time":"2006-01-09T13:57:20Z","timestamp":1136815040000},"page":"49-62","source":"Crossref","is-referenced-by-count":34,"title":["On the Complexity of Adjacent Resource Scheduling"],"prefix":"10.1007","volume":"9","author":[{"given":"C. W.","family":"Duin","sequence":"first","affiliation":[]},{"given":"E. Van","family":"Der Sluis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5593_CR1","unstructured":"Al-Ibrahim, A., C. W. Duin, and E. van der Sluis, \u201cInteger Programming Formulations for Adjacent Resource Scheduling,\u201d AE-Report 2\/2003, Faculty of Economics and Econometrics, University of Amsterdam (2003)."},{"key":"5593_CR2","first-page":"1","volume-title":"Proceedings of the 5th Annual European Symposium on Algorithms, Graz, Austria, Lecture Notes in Computer Science 1284","author":"A. K. Amoura","year":"1997","unstructured":"Amoura, A. K., E. Bampis, C. Kenyon, and Y. Manoussakis, \u201cScheduling independent multiprocessor tasks,\u201d in Proceedings of the 5th Annual European Symposium on Algorithms, Graz, Austria, Lecture Notes in Computer Science 1284, Springer-Verlag, Berlin, 1\u201312, 1997."},{"key":"5593_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"C-35","author":"J. Blazewicz","year":"1986","unstructured":"Blazewicz, J., M. Drozdowski, and J. Weglarz, \u201cScheduling multiprocessor tasks to minimize schedule lengths,\u201d IEEE Transactions on Computers, C-35, 389\u2013393 (1986).","journal-title":"IEEE Transactions on Computers"},{"key":"5593_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","volume":"41","author":"J. Blazewicz","year":"1992","unstructured":"Blazewicz, J., P. Dell'Olmo, M. Drozdowski, and M. Speranza, \u201cScheduling multiprocessor tasks on three dedicated processors,\u201d Information Processing Letters 41, 275\u2013280 (1992) and (Erratum) Information Processing Letters, 49, 269\u2013270 (1994).","journal-title":"Information Processing Letters"},{"key":"5593_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Blazewicz","year":"2001","unstructured":"Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer Verlag, Berlin, 2001."},{"key":"5593_CR6","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., C. N. Potts and G.J. Woeginger, \u201cA review of machine scheduling: Complexity, Algorithms and Approximability,\u201d in D.Z. Du and P. Pardalos (eds.), Handbook of Combinatorial Optimization, Kluwer Academic Press, Boston, 21\u2013169 (1998)."},{"key":"5593_CR7","doi-asserted-by":"crossref","unstructured":"Chen, J. and A. Miranda, \u201cA polynomial time approximation scheme for general multiprocessor job scheduling,\u201d SIAM Journal on computing, 2001, 1\u201317.","DOI":"10.1137\/S0097539798348110"},{"key":"5593_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0952-1976(96)00017-6","volume":"9","author":"H. N. Chun","year":"1996","unstructured":"Chun, H. N., \u201cScheduling as a multidimensional Placement Problem,\u201d Engineering Applications of Artificial Intelligence, 9, 261\u2013273 (1996).","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"5593_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"Drozdowski, M., \u201cMultiprocessor scheduling: An overview,\u201d European Journal of Operational Research, 94, 215\u2013230 (1996).","journal-title":"European Journal of Operational Research"},{"key":"5593_CR10","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J. and J. Y. -T. Leung, \u201cComplexity of scheduling parallel task systems,\u201d SIAM J. Discrete Mathematics, 2, 473\u2013487 (1989).","journal-title":"SIAM J. Discrete Mathematics"},{"key":"5593_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H., \u201cA typology of cutting and packing problems,\u201d European Journal of Operational Research, 44, 145\u2013159 (1990).","journal-title":"European Journal of Operational Research"},{"key":"5593_CR12","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I., \u201cThe NP-completeness of edge-coloring,\u201d SIAM Journal on Computing, 10, 718\u2013720 (1981).","journal-title":"SIAM Journal on Computing"},{"key":"5593_CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J. A. Hoogeveen","year":"1994","unstructured":"Hoogeveen, J. A., S. L. van de Velde, and B. Veltman, \u201cComplexity of scheduling multiprocessor tasks with prespecified processor allocations,\u201d Discrete Applied Mathematics, 55, 259\u2013272 (1994).","journal-title":"Discrete Applied Mathematics"},{"key":"5593_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90176-1","volume":"24","author":"M. Kubale","year":"1987","unstructured":"Kubale, M., \u201cThe complexity of scheduling independent two-processor tasks on dedicated processors,\u201d Information Processing Letters, 24, 141\u2013147 (1987).","journal-title":"Information Processing Letters"},{"key":"5593_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys, \u201cSequencing and Scheduling: Algorithms and complexity\u201d, in S.S. Graves, A.H.G Rinnooy Kan, and P. Zipkin, (Eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, 445\u2013522, North Holland, New York, 1993."},{"key":"5593_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., S. Martello, and M. Monaci, \u201cTwo-dimensional packing problems: A survey,\u201d European Journal of Operational Research, 141, 241\u2013252 (2002).","journal-title":"European Journal of Operational Research"},{"key":"5593_CR17","volume-title":"Operations Scheduling with Applications in Manufacturing and Services","author":"M. Pinedo","year":"1999","unstructured":"Pinedo,M. and X. Chao, \u201cOperations Scheduling with Applications in Manufacturing and Services,\u201d Irwin\/McGraw-Hill, New York, 1999."},{"key":"5593_CR18","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2001","unstructured":"Pinedo, M., \u201cScheduling: Theory, Algorithms, and Systems,\u201d Prentice Hall, New Jersey, 2001."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5593-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-5593-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5593-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T03:53:37Z","timestamp":1683345217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-5593-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["5593"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-5593-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}