{"id":"https://openalex.org/W4391423656","doi":"https://doi.org/10.1109/ieem58616.2023.10406963","title":"Workload-based Extensions of Mixed-integer Programming Models for Resource-constrained Project Scheduling","display_name":"Workload-based Extensions of Mixed-integer Programming Models for Resource-constrained Project Scheduling","publication_year":2023,"publication_date":"2023-12-18","ids":{"openalex":"https://openalex.org/W4391423656","doi":"https://doi.org/10.1109/ieem58616.2023.10406963"},"language":"en","primary_location":{"id":"doi:10.1109/ieem58616.2023.10406963","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ieem58616.2023.10406963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","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/A5093836692","display_name":"Jonas Saupe","orcid":"https://orcid.org/0009-0000-2331-4000"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"J. Saupe","raw_affiliation_strings":["University of Bern,Department of Business Administration,Bern,Switzerland,3012"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077090856","display_name":"Mario Gn\u00e4gi","orcid":"https://orcid.org/0000-0002-3423-0782"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"M. Gn\u00e4gi","raw_affiliation_strings":["University of Bern,Department of Business Administration,Bern,Switzerland,3012"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063630096","display_name":"\u039d. Trautmann","orcid":"https://orcid.org/0000-0003-0951-6567"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"N. Trautmann","raw_affiliation_strings":["University of Bern,Department of Business Administration,Bern,Switzerland,3012"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5093836692"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25645524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"0645","last_page":"0649"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.9889000058174133,"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/T10395","display_name":"Construction Project Management and Performance","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7506252527236938},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6824420690536499},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6421465277671814},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6183630228042603},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6006102561950684},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5773925185203552},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5333224534988403},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4359055161476135},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4100992977619171},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13595643639564514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12904247641563416},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1258319616317749},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.10996285080909729}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7506252527236938},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6824420690536499},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6421465277671814},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6183630228042603},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6006102561950684},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5773925185203552},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5333224534988403},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4359055161476135},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4100992977619171},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13595643639564514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12904247641563416},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1258319616317749},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.10996285080909729},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieem58616.2023.10406963","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ieem58616.2023.10406963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","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":10,"referenced_works":["https://openalex.org/W1964195749","https://openalex.org/W1998452272","https://openalex.org/W2005096614","https://openalex.org/W2031216051","https://openalex.org/W2036112575","https://openalex.org/W2153864093","https://openalex.org/W2884858779","https://openalex.org/W2970385781","https://openalex.org/W4205938525","https://openalex.org/W7055612015"],"related_works":["https://openalex.org/W2348837382","https://openalex.org/W2000785801","https://openalex.org/W986318368","https://openalex.org/W2384410913","https://openalex.org/W2352878646","https://openalex.org/W2004734601","https://openalex.org/W2130149817","https://openalex.org/W2990194547","https://openalex.org/W1480123525","https://openalex.org/W2147600044"],"abstract_inverted_index":{"The":[0],"resource-constrained":[1],"project":[2,14,25],"scheduling":[3],"problem":[4],"describes":[5],"a":[6,13,20,71],"situation":[7],"in":[8],"which":[9,64],"the":[10,61,89,101,108],"duration":[11],"of":[12,88],"must":[15],"be":[16,57],"minimized":[17],"by":[18],"choosing":[19],"start":[21],"time":[22],"for":[23,40,85],"each":[24],"activity":[26],"subject":[27],"to":[28,48,96,112],"given":[29],"precedence":[30],"constraints":[31],"and":[32,78],"resource":[33],"capacities.":[34],"Various":[35],"mixed-integer":[36],"programming":[37],"models":[38,47,99,115],"exist":[39],"this":[41],"problem.":[42],"Approaches":[43],"that":[44,81,107],"extend":[45],"these":[46],"enhance":[49],"their":[50,66],"performance":[51],"are":[52],"often":[53],"formulation-specific":[54],"or":[55],"cannot":[56],"easily":[58],"integrated":[59],"with":[60],"original":[62],"model,":[63],"limits":[65],"practical":[67],"applicability.":[68],"We":[69,92],"suggest":[70],"model":[72],"extension":[73,109],"based":[74],"on":[75],"auxiliary":[76],"variables":[77],"redundant":[79],"con-straints":[80],"describe":[82],"workload":[83],"limitations":[84],"certain":[86],"subsets":[87],"planning":[90],"horizon.":[91],"apply":[93],"our":[94],"approach":[95],"three":[97,114],"state-of-the-art":[98],"from":[100],"literature.":[102],"A":[103],"computational":[104],"evaluation":[105],"demonstrates":[106],"is":[110],"beneficial":[111],"all":[113],"tested.":[116]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}