{"id":"https://openalex.org/W2983697511","doi":"https://doi.org/10.1109/ieem44572.2019.8978811","title":"A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem","display_name":"A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W2983697511","doi":"https://doi.org/10.1109/ieem44572.2019.8978811","mag":"2983697511"},"language":"en","primary_location":{"id":"doi:10.1109/ieem44572.2019.8978811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/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":true,"raw_author_name":"M. Gn\u00e4gi","raw_affiliation_strings":["University of Bern,Department of Business Administration,Bern,Switzerland,3012","Department of Business Administration, University of Bern, Bern, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]},{"raw_affiliation_string":"Department of Business Administration, University of Bern, Bern, Switzerland","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","Department of Business Administration, University of Bern, Bern, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Bern,Department of Business Administration,Bern,Switzerland,3012","institution_ids":["https://openalex.org/I118564535"]},{"raw_affiliation_string":"Department of Business Administration, University of Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077090856"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":0.6186,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74177045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"611","last_page":"614"},"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.9751999974250793,"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.9627000093460083,"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.691020667552948},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6602542996406555},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5945873260498047},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5877236127853394},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5699893832206726},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5324916243553162},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5228031873703003},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.18601995706558228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18063467741012573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15017443895339966}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.691020667552948},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6602542996406555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5945873260498047},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5877236127853394},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5699893832206726},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5324916243553162},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5228031873703003},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.18601995706558228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18063467741012573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15017443895339966},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ieem44572.2019.8978811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem44572.2019.8978811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},{"id":"pmh:oai:boris.unibe.ch:138875","is_oa":false,"landing_page_url":"https://boris.unibe.ch/138875/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gn\u00e4gi, Mario; Trautmann, Norbert (16 December 2019). A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).. Macau. 15.-18.12.2019.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1973131489","https://openalex.org/W2744981330","https://openalex.org/W2786743500","https://openalex.org/W2965350733"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3122821775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0,32],"execution":[1],"of":[2,37,50,69,114,129,136],"a":[3,19,39,87,101,111,118,127,141],"project":[4,75],"is":[5,77,90,145],"nowadays":[6],"often":[7],"distributed":[8],"among":[9],"multiple":[10],"sites.":[11,31,108],"While":[12],"some":[13],"resource":[14,24,57,88],"units":[15,25],"are":[16,44,104],"available":[17],"at":[18,65,106],"certain":[20],"site":[21],"only,":[22],"other":[23],"can":[26,62,166],"be":[27,63,82,167],"moved":[28,91],"across":[29],"the":[30,51,66,70,74,134,146,151,159],"problem":[33,116],"considered":[34],"here":[35],"consists":[36],"scheduling":[38],"single":[40],"projects'":[41],"activities":[42,98],"which":[43,144],"interrelated":[45,99],"by":[46,100],"given":[47],"precedence":[48,102],"relationships":[49],"completion-start":[52],"type,":[53],"require":[54],"various":[55],"renewable":[56],"types":[58],"during":[59],"execution,":[60],"and":[61,171],"executed":[64,105],"different":[67,107],"sites":[68],"project,":[71],"such":[72],"that":[73,156],"makespan":[76],"minimized;":[78],"transportation":[79],"times":[80],"must":[81],"taken":[83],"into":[84],"account":[85],"if":[86,96],"unit":[89],"between":[92],"two":[93,97],"sites,":[94],"or":[95],"relationship":[103],"We":[109],"present":[110],"continuous-time":[112,161],"formulation":[113,139,148],"this":[115,137],"as":[117],"mixed-binary":[119],"linear":[120],"program.":[121],"In":[122],"an":[123],"experiment":[124],"based":[125],"on":[126],"set":[128],"480":[130],"instances,":[131],"we":[132],"compared":[133],"performance":[135],"novel":[138,160],"with":[140],"discrete-time":[142],"formulation,":[143,162],"only":[147],"known":[149],"from":[150],"literature;":[152],"it":[153],"turned":[154],"out":[155],"when":[157],"using":[158],"considerably":[163],"more":[164],"instances":[165],"solved":[168],"to":[169,172],"feasibility":[170],"optimality,":[173],"respectively.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}