{"id":"https://openalex.org/W1567410598","doi":"https://doi.org/10.1007/s10951-006-5593-6","title":"On the Complexity of Adjacent Resource Scheduling","display_name":"On the Complexity of Adjacent Resource Scheduling","publication_year":2006,"publication_date":"2006-01-09","ids":{"openalex":"https://openalex.org/W1567410598","doi":"https://doi.org/10.1007/s10951-006-5593-6","mag":"1567410598"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-006-5593-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-006-5593-6","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.uva.nl/ws/files/1319006/96102_333fulltext.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008573711","display_name":"C.W. Duin","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"C. W. Duin","raw_affiliation_strings":["Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077774256","display_name":"Erik van der Sluis","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"E. Van Der Sluis","raw_affiliation_strings":["Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.82,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75665009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"9","issue":"1","first_page":"49","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6949487924575806},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.619299054145813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5381302237510681},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5225548148155212},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5088555812835693},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46998822689056396},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4288058280944824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35372769832611084},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21935760974884033},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.19855055212974548},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09187853336334229}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6949487924575806},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.619299054145813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5381302237510681},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5225548148155212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5088555812835693},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46998822689056396},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4288058280944824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35372769832611084},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21935760974884033},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.19855055212974548},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09187853336334229},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s10951-006-5593-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-006-5593-6","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/112f0594-2e16-414b-b9db-ed2215737f60","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(112f0594-2e16-414b-b9db-ed2215737f60).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Duin, C W & van der Sluis, E 2006, 'On the complexity of Adjacent Resource Scheduling', Journal of Scheduling, vol. 9, no. 1, pp. 49-62. https://doi.org/10.1007/s10951-006-5593-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/8bf573dc-350a-4ede-85bf-ea042ca19682","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(8bf573dc-350a-4ede-85bf-ea042ca19682).html","pdf_url":"https://pure.uva.nl/ws/files/1319006/96102_333fulltext.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Duin, C W & van der Sluis, E 2004 'On the complexity of adjacent resource scheduling' Report AE, no. 6/2004, Amsterdam. < http://www1.feb.uva.nl/pp/bin/333fulltext.pdf >","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/8bf573dc-350a-4ede-85bf-ea042ca19682","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(8bf573dc-350a-4ede-85bf-ea042ca19682).html","pdf_url":"https://dare.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(8bf573dc-350a-4ede-85bf-ea042ca19682).html","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/workingpaper"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/112f0594-2e16-414b-b9db-ed2215737f60","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(112f0594-2e16-414b-b9db-ed2215737f60).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Scheduling, 9(1), 49 - 62. Springer New York","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:1567410598","is_oa":false,"landing_page_url":"https://pure.uva.nl/ws/files/1319006/96102_333fulltext.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:publications/8bf573dc-350a-4ede-85bf-ea042ca19682","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-complexity-of-adjacent-resource-scheduling(8bf573dc-350a-4ede-85bf-ea042ca19682).html","pdf_url":"https://pure.uva.nl/ws/files/1319006/96102_333fulltext.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Duin, C W & van der Sluis, E 2004 'On the complexity of adjacent resource scheduling' Report AE, no. 6/2004, Amsterdam. < http://www1.feb.uva.nl/pp/bin/333fulltext.pdf >","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321008","display_name":"Universiteit van Amsterdam","ror":"https://ror.org/04dkp9463"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1567410598.pdf","grobid_xml":"https://content.openalex.org/works/W1567410598.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W5599802","https://openalex.org/W964861289","https://openalex.org/W1566877084","https://openalex.org/W1966275651","https://openalex.org/W1979415050","https://openalex.org/W1998948241","https://openalex.org/W2032392871","https://openalex.org/W2038534673","https://openalex.org/W2053538576","https://openalex.org/W2057913648","https://openalex.org/W2063957224","https://openalex.org/W2101848567","https://openalex.org/W2102669784","https://openalex.org/W2135507920","https://openalex.org/W4299584423","https://openalex.org/W6639903763","https://openalex.org/W6678371554"],"related_works":["https://openalex.org/W1971702637","https://openalex.org/W2101848567","https://openalex.org/W1590402696","https://openalex.org/W2162870855","https://openalex.org/W1558276387","https://openalex.org/W1970631330","https://openalex.org/W1999466794","https://openalex.org/W3041309500","https://openalex.org/W1601908203","https://openalex.org/W1484079083","https://openalex.org/W2568675888","https://openalex.org/W2032570272","https://openalex.org/W38423048","https://openalex.org/W2005650729","https://openalex.org/W2020006381","https://openalex.org/W193048536","https://openalex.org/W2306549693","https://openalex.org/W2004342357","https://openalex.org/W2793045913","https://openalex.org/W2563842788"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-10T00:00:00"}