{"id":"https://openalex.org/W56050749","doi":null,"title":"A planning/scheduling methodology for the constrained resource problem","display_name":"A planning/scheduling methodology for the constrained resource problem","publication_year":1989,"publication_date":"1989-08-20","ids":{"openalex":"https://openalex.org/W56050749","mag":"56050749"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.8754","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.8754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dli.iiit.ac.in/ijcai/IJCAI-89-VOL-2/PDF/024.pdf","raw_type":"text"},"volume":null,"type":"article","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/A5014372338","display_name":"Naiping Keng","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Naiping Keng","raw_affiliation_strings":["Dept. of Computer Science & Engineering, Southern Methodist University, Dallas, Texas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science & Engineering, Southern Methodist University, Dallas, Texas","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110266401","display_name":"David Y. Y. Yun","orcid":"https://orcid.org/0000-0003-3114-7745","observed_orcids":["https://orcid.org/0000-0003-3114-7745"]},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Y. Y. Yun","raw_affiliation_strings":["Dept. of Computer Science & Engineering, Southern Methodist University, Dallas, Texas"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science & Engineering, Southern Methodist University, Dallas, Texas","institution_ids":["https://openalex.org/I178169726"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I178169726"],"apc_list":null,"apc_paid":null,"fwci":11.6389,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.9882427,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"998","last_page":"1003"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.6352999806404114,"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.6352999806404114,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.27320000529289246,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.06319999694824219,"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/planning-and-scheduling","display_name":"planning and scheduling","score":0.8450000286102295},{"id":"https://openalex.org/keywords/task-interaction","display_name":"task interaction","score":0.5580000281333923},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.4659999907016754},{"id":"https://openalex.org/keywords/backtracking-reduction","display_name":"backtracking reduction","score":0.8550000190734863},{"id":"https://openalex.org/keywords/domain-independent-heuristics","display_name":"domain-independent heuristics","score":0.675000011920929},{"id":"https://openalex.org/keywords/task-criticality","display_name":"task criticality","score":0.414000004529953}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7451977729797363},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6353399753570557},{"id":"https://openalex.org/C126231374","wikidata":"https://www.wikidata.org/wiki/Q1061298","display_name":"Operability","level":2,"score":0.5965621471405029},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5243863463401794},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5226519107818604},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4875445067882538},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.4772063195705414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44661396741867065},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.44548171758651733},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39439934492111206},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3671608567237854},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16160959005355835},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.1287207305431366},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.12418022751808167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12038344144821167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09202751517295837},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07700648903846741},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.8754","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.8754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dli.iiit.ac.in/ijcai/IJCAI-89-VOL-2/PDF/024.pdf","raw_type":"text"},{"id":"mag:56050749","doi":null,"is_oa":false,"landing_page_url":"http://ijcai.org/Proceedings/89-2/Papers/024.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint 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":"International Joint 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":11,"referenced_works":["https://openalex.org/W125130877","https://openalex.org/W1484780672","https://openalex.org/W1550402024","https://openalex.org/W1606581042","https://openalex.org/W1976303542","https://openalex.org/W1979569488","https://openalex.org/W2021337406","https://openalex.org/W2024182184","https://openalex.org/W2042312329","https://openalex.org/W2061734130","https://openalex.org/W2068852367"],"related_works":["https://openalex.org/W69355719","https://openalex.org/W2117001482","https://openalex.org/W3041999135","https://openalex.org/W2102075605","https://openalex.org/W2399079241","https://openalex.org/W7100084494","https://openalex.org/W2954825217","https://openalex.org/W790720801","https://openalex.org/W2523470351","https://openalex.org/W2967952306"],"abstract_inverted_index":{"This":[0,139],"paper":[1],"presents":[2],"a":[3,66,76,88],"new":[4],"planning/scheduling":[5,54,134],"methodology":[6],"for":[7,38,90,136],"the":[8,15,27,39,71,91,96,104,107,110,117,150],"constrained":[9,79],"resource":[10],"problem":[11,122],"(CRP),":[12],"in":[13,148],"which":[14,73,102,149],"amount":[16,151],"of":[17,98,109,121,152],"available":[18],"resources":[19],"is":[20,78],"limited":[21,40],"and":[22,48,119,132],"usually":[23],"monotonically":[24],"diminishing":[25],"as":[26],"planning":[28],"process":[29],"progresses.":[30],"The":[31,62,83],"tasks":[32],"are":[33],"tightly-coupled":[34],"since":[35],"they":[36],"compete":[37],"resources.":[41],"Two":[42],"domain":[43],"independent":[44],"policies":[45,114],"\u2014":[46],"most-constraint":[47,63],"least-tmpact":[49],"help":[50],"to":[51,57,70,95,145],"make":[52],"this":[53,127],"approach":[55],"sensitive":[56],"dynamic":[58],"interactions":[59],"among":[60],"tasks.":[61,112],"policy":[64,85],"selects":[65],"task":[67,77,81,93],"dynamically":[68,86],"according":[69,94],"criticality,":[72],"measures":[74],"how":[75],"by":[80,124],"interaction.":[82],"least-impact":[84],"chooses":[87],"solution":[89],"selected":[92],"cruciality":[97],"each":[99],"possible":[100],"solution,":[101],"expresses":[103],"impact":[105],"on":[106],"rest":[108],"unachieved":[111],"These":[113],"have":[115],"enhanced":[116],"operability":[118],"measurability":[120],"solving":[123],"planning/scheduling.":[125],"Hence,":[126],"method":[128],"can":[129],"provide":[130],"realistic":[131],"executable":[133],"guidelines":[135],"CRP":[137],"solvers.":[138],"model":[140],"has":[141,154],"been":[142,155],"successfully":[143],"applied":[144],"several":[146],"CRPs":[147],"backtracking":[153],"reduced":[156],"dramatically.":[157]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}