{"id":"https://openalex.org/W98703261","doi":null,"title":"Why is scheduling difficult? a CSP perspective","display_name":"Why is scheduling difficult? a CSP perspective","alternate_titles":[],"publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W98703261","mag":"98703261"},"language":"en","primary_location":{"id":"mag:98703261","doi":null,"is_oa":false,"landing_page_url":"http://eil.utoronto.ca/wp-content/uploads/public/papers/SCHED_CSP.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418308","display_name":"European Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"European Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W98703261"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5062466238","display_name":"Mark S. Fox","orcid":"https://orcid.org/0000-0001-7444-6310","observed_orcids":["https://orcid.org/0000-0001-7444-6310"]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mark S. Fox","raw_affiliation_strings":["University of Toronto"],"raw_orcid":"https://orcid.org/0000-0001-7444-6310","affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081563886","display_name":"Norman Sadeh","orcid":"https://orcid.org/0000-0003-4829-5533","observed_orcids":["https://orcid.org/0000-0003-4829-5533"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norman Sadeh","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4829-5533","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8448,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.90193603,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"754","last_page":"767"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0005000000237487257,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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","score":0.8489999771118164},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.9929999709129333},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"constraint programming","score":0.47200000286102295},{"id":"https://openalex.org/keywords/interval-constraints","display_name":"interval constraints","score":0.7020000219345093},{"id":"https://openalex.org/keywords/time-constraints","display_name":"time constraints","score":0.7609999775886536},{"id":"https://openalex.org/keywords/spatial-constraints","display_name":"spatial constraints","score":0.6859999895095825},{"id":"https://openalex.org/keywords/consistency-techniques","display_name":"consistency techniques","score":0.6840000152587891},{"id":"https://openalex.org/keywords/disjunctive-constraints","display_name":"disjunctive constraints","score":0.8510000109672546},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.5920000076293945},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8270000219345093},{"id":"https://openalex.org/keywords/constraint-relaxation","display_name":"constraint relaxation","score":0.7059999704360962},{"id":"https://openalex.org/keywords/planning","display_name":"planning","score":0.30799999833106995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6420978307723999},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6239465475082397},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5618628859519958},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5560452938079834},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5480248928070068},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48755282163619995},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4406944513320923},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43913328647613525},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.42939433455467224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.341316819190979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2755877375602722},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.12054461240768433},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10592648386955261},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09833234548568726},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.07197412848472595},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:98703261","doi":null,"is_oa":false,"landing_page_url":"http://eil.utoronto.ca/wp-content/uploads/public/papers/SCHED_CSP.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418308","display_name":"European Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"European Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W14730544","https://openalex.org/W38226901","https://openalex.org/W56050749","https://openalex.org/W164193862","https://openalex.org/W1548476006","https://openalex.org/W1550402024","https://openalex.org/W1579008505","https://openalex.org/W1606581042","https://openalex.org/W1684304711","https://openalex.org/W1828757688","https://openalex.org/W2002391930","https://openalex.org/W2002478775","https://openalex.org/W2009567133","https://openalex.org/W2011039300","https://openalex.org/W2024182184","https://openalex.org/W2039358567","https://openalex.org/W2042312329","https://openalex.org/W2042619750","https://openalex.org/W2044173464","https://openalex.org/W2068852367","https://openalex.org/W2075759613","https://openalex.org/W2080986072","https://openalex.org/W2081851784","https://openalex.org/W2084548562","https://openalex.org/W2088174216","https://openalex.org/W2088304441","https://openalex.org/W2109424601","https://openalex.org/W2110601370","https://openalex.org/W2135432705","https://openalex.org/W2140545315","https://openalex.org/W2161484642","https://openalex.org/W2171798962","https://openalex.org/W2984454117"],"related_works":["https://openalex.org/W1977690101","https://openalex.org/W2602282189","https://openalex.org/W1560264223","https://openalex.org/W2044762487","https://openalex.org/W2148717184","https://openalex.org/W7161247181","https://openalex.org/W2033135391","https://openalex.org/W2030498833","https://openalex.org/W2192167498","https://openalex.org/W2523470351"],"abstract_inverted_index":{"Interest":[0],"in":[1,103,115,142,175,187,192],"Constraint":[2,50],"Satisfaction":[3],"Problems":[4],"(CSP)":[5],"continues":[6],"to":[7,58,177,209],"grow,":[8],"fueled":[9],"by":[10],"both":[11],"their":[12,42],"uniform":[13],"problem":[14,22,91,114,164],"representation,":[15],"i.e.,":[16,24],"constraint":[17,144,190],"graph,":[18],"and":[19,28,39,41,46,65,85,105,183],"conceptually":[20],"clear":[21],"solver,":[23],"heuristically":[25],"guided":[26],"variable":[27],"value":[29,208],"ordering.":[30],"With":[31],"the":[32,47,86,100,143,160,163,203,206],"advent":[33],"of":[34,49,73,88,96,135,155,205],"interval":[35],"constraints,":[36],"e.g,":[37],"temporal":[38],"spatial,":[40],"associated":[43],"consistency":[44],"techniques,":[45],"availability":[48],"Language":[51],"Programming":[52],"(CLP)":[53],"it":[54],"has":[55],"become":[56],"possible":[57],"explore":[59],"complex":[60,76],"problems":[61,78,97,150,186],"such":[62],"as":[63,82,128,130],"planning":[64],"scheduling.":[66],"This":[67],"paper":[68],"explores":[69],"how":[70],"a":[71,83,116,122,153,179,210],"sequence":[72],"successively":[74],"more":[75,171],"scheduling":[77,107,149],"can":[79],"be":[80,126,173],"modeled":[81],"CSP,":[84],"relevance":[87],"existing":[89],"CSP":[90,101],"solving":[92,106],"heuristics.":[93],"A":[94],"number":[95],"arise":[98],"with":[99],"paradigm":[102],"modeling":[104],"problems:":[108],"1)":[109],"Scheduling":[110],"is":[111,158,165],"an":[112],"optimization":[113],"very":[117],"large":[118],"combinatorial":[119],"space.":[120],"Therefore":[121],"good":[123],"solution":[124],"must":[125],"found":[127],"quickly":[129],"possible.":[131],"2)":[132],"The":[133],"existence":[134],"alternative":[136],"process":[137],"plans":[138],"introduces":[139],"disjunctive":[140],"constraints":[141,172],"graph.":[145],"3)":[146],"In":[147],"most":[148],"there":[151],"exists":[152],"plethora":[154],"constraints.":[156],"It":[157],"often":[159],"case":[161],"that":[162,168],"infeasible,":[166],"requiring":[167],"one":[169],"or":[170],"relaxed":[174],"order":[176],"find":[178],"solution.":[180],"4)":[181],"Scheduling,":[182],"resource":[184],"allocation":[185],"general,":[188],"have":[189],"graphs":[191],"which":[193],"many":[194],"variables":[195],"are":[196],"tightly":[197],"coupled":[198],"(by":[199],"capacity":[200],"constraints)":[201],"restricting":[202],"assignment":[204],"same":[207],"single":[211],"variable.":[212]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W98703261","counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
