{"id":"https://openalex.org/W2037958905","doi":"https://doi.org/10.1016/s0166-218x(01)00342-0","title":"Scheduling and constraint propagation","display_name":"Scheduling and constraint propagation","publication_year":2002,"publication_date":"2002-10-14","ids":{"openalex":"https://openalex.org/W2037958905","doi":"https://doi.org/10.1016/s0166-218x(01)00342-0","mag":"2037958905"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(01)00342-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00342-0","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000179258","display_name":"Peter Brucker","orcid":null},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Brucker","raw_affiliation_strings":["Department of Mathematics and Computer Science, Universit\u00e4t Osnabr\u00fcck, D-49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Universit\u00e4t Osnabr\u00fcck, D-49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000179258"],"corresponding_institution_ids":["https://openalex.org/I170658231"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.9181,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.77037087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"123","issue":"1-3","first_page":"227","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9825000166893005,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7075110673904419},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6630163788795471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6234688758850098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5629011988639832},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5208307504653931},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.48513850569725037},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.48438435792922974},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.44011250138282776},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4315353035926819},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41459816694259644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3734033405780792},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.32557186484336853},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1389153003692627}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7075110673904419},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6630163788795471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6234688758850098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5629011988639832},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5208307504653931},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.48513850569725037},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.48438435792922974},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.44011250138282776},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4315353035926819},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41459816694259644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3734033405780792},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.32557186484336853},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1389153003692627},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(01)00342-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00342-0","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W599921418","https://openalex.org/W964861289","https://openalex.org/W1486993561","https://openalex.org/W1492232938","https://openalex.org/W1563800566","https://openalex.org/W1571778186","https://openalex.org/W1583233220","https://openalex.org/W1610326124","https://openalex.org/W1964701519","https://openalex.org/W1967520000","https://openalex.org/W1976933890","https://openalex.org/W1982061997","https://openalex.org/W1986769982","https://openalex.org/W1987080057","https://openalex.org/W1992710140","https://openalex.org/W2005096614","https://openalex.org/W2007363252","https://openalex.org/W2012303397","https://openalex.org/W2020459421","https://openalex.org/W2024237395","https://openalex.org/W2038345112","https://openalex.org/W2041252124","https://openalex.org/W2051751101","https://openalex.org/W2071306171","https://openalex.org/W2075268613","https://openalex.org/W2077745719","https://openalex.org/W2078122796","https://openalex.org/W2091316547","https://openalex.org/W2105413595","https://openalex.org/W2106371135","https://openalex.org/W2106622621","https://openalex.org/W2121865860","https://openalex.org/W2122967269","https://openalex.org/W2125266303","https://openalex.org/W2130272456","https://openalex.org/W2148748601","https://openalex.org/W2149521180","https://openalex.org/W2157002008","https://openalex.org/W2164950451","https://openalex.org/W2169586176","https://openalex.org/W2324866405","https://openalex.org/W2338905098","https://openalex.org/W2341350247","https://openalex.org/W2399362491","https://openalex.org/W2487540326","https://openalex.org/W2576116471","https://openalex.org/W4236129682","https://openalex.org/W4254292280","https://openalex.org/W6629434534","https://openalex.org/W6630818061","https://openalex.org/W6633910555","https://openalex.org/W6634255248","https://openalex.org/W6812197442"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W4303044088","https://openalex.org/W202947224","https://openalex.org/W1547037969","https://openalex.org/W96881443","https://openalex.org/W2141935412"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}