{"id":"https://openalex.org/W3145081291","doi":"https://doi.org/10.1109/wsc.2009.5429671","title":"Resource leveling of linear schedules with singularity functions","display_name":"Resource leveling of linear schedules with singularity functions","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W3145081291","doi":"https://doi.org/10.1109/wsc.2009.5429671","mag":"3145081291"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2009.5429671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2009.5429671","pdf_url":null,"source":{"id":"https://openalex.org/S4363608998","display_name":"Proceedings of the 2009 Winter Simulation Conference (WSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 Winter Simulation Conference (WSC)","raw_type":"proceedings-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/A5025135521","display_name":"Gunnar Lucko","orcid":"https://orcid.org/0000-0002-7355-3365"},"institutions":[{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]},{"id":"https://openalex.org/I168959743","display_name":"University of America","ror":"https://ror.org/03s0c9350","country_code":"US","type":"education","lineage":["https://openalex.org/I168959743"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gunnar Lucko","raw_affiliation_strings":["Department of Civil Engineering, Catholic University of America, Washington D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering, Catholic University of America, Washington D.C., DC, USA","institution_ids":["https://openalex.org/I168959743","https://openalex.org/I84470341"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060510541","display_name":"Angel A. Pe\u00f1a Orozco","orcid":null},"institutions":[{"id":"https://openalex.org/I168959743","display_name":"University of America","ror":"https://ror.org/03s0c9350","country_code":"US","type":"education","lineage":["https://openalex.org/I168959743"]},{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Angel A. Pena Orozco","raw_affiliation_strings":["Department of Civil Engineering, Catholic University of America, Washington D.C., DC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering, Catholic University of America, Washington D.C., DC, USA","institution_ids":["https://openalex.org/I168959743","https://openalex.org/I84470341"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025135521"],"corresponding_institution_ids":["https://openalex.org/I168959743","https://openalex.org/I84470341"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.39504132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"2571","last_page":"2582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9994000196456909,"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.9994000196456909,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11006","display_name":"BIM and Construction Integration","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/schedule","display_name":"Schedule","score":0.6995092630386353},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6385465264320374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6048681139945984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5931472182273865},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5293503403663635},{"id":"https://openalex.org/keywords/moment","display_name":"Moment (physics)","score":0.5007481575012207},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4531285762786865},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4330999255180359},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3312344551086426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2661899924278259},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1590156853199005},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07256323099136353}],"concepts":[{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6995092630386353},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6385465264320374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6048681139945984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5931472182273865},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5293503403663635},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.5007481575012207},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4531285762786865},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4330999255180359},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3312344551086426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2661899924278259},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1590156853199005},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07256323099136353},{"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc.2009.5429671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2009.5429671","pdf_url":null,"source":{"id":"https://openalex.org/S4363608998","display_name":"Proceedings of the 2009 Winter Simulation Conference (WSC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 Winter Simulation Conference (WSC)","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":19,"referenced_works":["https://openalex.org/W200855800","https://openalex.org/W1968001319","https://openalex.org/W1972441949","https://openalex.org/W1974209832","https://openalex.org/W1977529610","https://openalex.org/W2030046419","https://openalex.org/W2042773241","https://openalex.org/W2069937638","https://openalex.org/W2101524924","https://openalex.org/W2105217850","https://openalex.org/W2110392196","https://openalex.org/W2149960902","https://openalex.org/W2625025390","https://openalex.org/W3143830512","https://openalex.org/W3146596001","https://openalex.org/W3147537548","https://openalex.org/W3148779352","https://openalex.org/W3148884155","https://openalex.org/W6608223452"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2102514425","https://openalex.org/W2962747841","https://openalex.org/W2014162767","https://openalex.org/W2630967916"],"abstract_inverted_index":{"This":[0],"paper":[1],"builds":[2],"on":[3],"a":[4,41,109,119,123,132],"new":[5],"methodology":[6],"of":[7,40,50,59,61,115,122],"modeling":[8],"linear":[9,138],"schedules":[10],"with":[11,80,140],"singularity":[12,128],"functions.":[13],"These":[14],"unique":[15],"functions":[16,129],"have":[17],"been":[18],"used":[19],"successfully":[20],"for":[21,35,72],"criticality":[22],"and":[23,105,118,144],"float":[24],"analyses.":[25],"The":[26],"approach":[27],"is":[28,68,83],"extended":[29],"to":[30,85],"deriving":[31],"one":[32],"flexible":[33],"equation":[34,54],"the":[36,47,56,62,66,69,74,97,116,137,146],"complete":[37],"resource":[38,48,63,75,93,142],"profile":[39,143],"schedule,":[42],"including":[43],"any":[44],"changes":[45],"in":[46],"rates":[49,94],"activities.":[51],"A":[52,77],"subsequent":[53],"describes":[55],"first":[57],"moment":[58,67],"area":[60],"profile.":[64,76],"Minimizing":[65],"objective":[70],"function":[71],"leveling":[73],"genetic":[78],"algorithm":[79],"inverse":[81],"ranking":[82],"computerized":[84],"perform":[86],"successive":[87],"iterations.":[88],"Chromosomes":[89],"contain":[90],"different":[91],"permutations":[92],"at":[95],"which":[96],"activities":[98],"can":[99,130],"be":[100],"performed.":[101],"Probabilistic":[102],"reproduction,":[103],"crossover,":[104],"mutation":[106],"steps":[107],"mimic":[108],"biological":[110],"selection":[111],"process.":[112,149],"Step-by-step":[113],"descriptions":[114],"calculations":[117],"detailed":[120],"example":[121],"construction":[124],"project":[125],"illustrate":[126],"how":[127],"provide":[131],"powerful":[133],"model":[134],"that":[135],"integrates":[136],"schedule":[139],"its":[141],"facilitates":[145],"overall":[147],"optimization":[148]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
