{"id":"https://openalex.org/W1986823591","doi":"https://doi.org/10.1145/1900008.1900097","title":"A simple dual-RAMP algorithm for resource constraint project scheduling","display_name":"A simple dual-RAMP algorithm for resource constraint project scheduling","publication_year":2010,"publication_date":"2010-04-15","ids":{"openalex":"https://openalex.org/W1986823591","doi":"https://doi.org/10.1145/1900008.1900097","mag":"1986823591"},"language":"en","primary_location":{"id":"doi:10.1145/1900008.1900097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1900008.1900097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48th Annual Southeast Regional Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5112253955","display_name":"Chris Riley","orcid":null},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Riley","raw_affiliation_strings":["University of Mississippi, University, MS","Univ. of Mississippi, University, MS#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mississippi, University, MS","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"Univ. of Mississippi, University, MS#TAB#","institution_ids":["https://openalex.org/I368840534"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051866947","display_name":"C\u00e9sar Rego","orcid":"https://orcid.org/0000-0002-1713-2494"},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesar Rego","raw_affiliation_strings":["University of Mississippi, University, MS","Univ. of Mississippi, University, MS#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mississippi, University, MS","institution_ids":["https://openalex.org/I368840534"]},{"raw_affiliation_string":"Univ. of Mississippi, University, MS#TAB#","institution_ids":["https://openalex.org/I368840534"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100453284","display_name":"Haitao Li","orcid":"https://orcid.org/0000-0001-7609-2819"},"institutions":[{"id":"https://openalex.org/I208333798","display_name":"University of Missouri\u2013St. Louis","ror":"https://ror.org/037cnag11","country_code":"US","type":"education","lineage":["https://openalex.org/I208333798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haitao Li","raw_affiliation_strings":["University of Missouri - St Louis, MO"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Missouri - St Louis, MO","institution_ids":["https://openalex.org/I208333798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998000264167786,"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.9998000264167786,"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.9726999998092651,"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/T11351","display_name":"Catalysis and Hydrodesulfurization Studies","score":0.9203000068664551,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/computer-science","display_name":"Computer science","score":0.7327238917350769},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.726658284664154},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5823208093643188},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5429506301879883},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.49692586064338684},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4950625002384186},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4722190201282501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4699079394340515},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.468345582485199},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42316773533821106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17681938409805298},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08622092008590698}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7327238917350769},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.726658284664154},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5823208093643188},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5429506301879883},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.49692586064338684},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4950625002384186},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4722190201282501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4699079394340515},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.468345582485199},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42316773533821106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17681938409805298},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08622092008590698},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1900008.1900097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1900008.1900097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48th Annual Southeast Regional Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W620587418","https://openalex.org/W1969848548","https://openalex.org/W1973131489","https://openalex.org/W1981134802","https://openalex.org/W1997294113","https://openalex.org/W2024237395","https://openalex.org/W2024681625","https://openalex.org/W2024742034","https://openalex.org/W2036112575","https://openalex.org/W2038345112","https://openalex.org/W2067801697","https://openalex.org/W2070891082","https://openalex.org/W2090359754","https://openalex.org/W2111185171","https://openalex.org/W2121852392","https://openalex.org/W2130469840","https://openalex.org/W2152216760","https://openalex.org/W2180268874"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W2130974462","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W4246352526","https://openalex.org/W2121910908","https://openalex.org/W915438175","https://openalex.org/W4230315250"],"abstract_inverted_index":{"A":[0],"Relaxation":[1],"Adaptive":[2],"Memory":[3],"Programming":[4],"(RAMP)":[5],"algorithm":[6,20,63],"is":[7],"developed":[8],"to":[9],"solve":[10],"large-scale":[11],"resource":[12],"constrained":[13],"project":[14],"scheduling":[15],"problems":[16,52],"(RCPSP).":[17],"The":[18],"RAMP":[19,62],"presented":[21],"here":[22],"takes":[23],"advantage":[24],"of":[25,50,60,74],"a":[26,31,40,47,56,71],"cross-parametric":[27],"relaxation":[28],"and":[29],"extends":[30],"recent":[32],"approach":[33],"that":[34,54],"casts":[35],"the":[36,61],"relaxed":[37],"problem":[38],"as":[39],"minimum":[41],"cut":[42],"problem.":[43],"Computational":[44],"results":[45],"on":[46],"classical":[48],"set":[49,73],"benchmark":[51],"show":[53],"even":[55],"relatively":[57],"simple":[58],"implementation":[59],"can":[64],"find":[65],"optimal":[66],"or":[67],"near-optimal":[68],"solutions":[69],"for":[70],"large":[72],"those":[75],"instances.":[76]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}