{"id":"https://openalex.org/W7123784902","doi":"https://doi.org/10.48550/arxiv.2601.06542","title":"Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach","display_name":"Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach","publication_year":2026,"publication_date":"2026-01-10","ids":{"openalex":"https://openalex.org/W7123784902","doi":"https://doi.org/10.48550/arxiv.2601.06542"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.06542","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.06542","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.06542","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088888713","display_name":"Corentin Juvigny","orcid":"https://orcid.org/0000-0002-8550-0746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juvigny, Corentin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052696241","display_name":"Anton\u00edn Nov\u00e1k","orcid":"https://orcid.org/0000-0003-2203-4554"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nov\u00e1k, Anton\u00edn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122912243","display_name":"Jan Mand\u00edk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mand\u00edk, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5122934792","display_name":"Zden\u011bk Hanz\u00e1lek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hanz\u00e1lek, Zden\u011bk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9150999784469604,"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.9150999784469604,"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.013799999840557575,"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/T11053","display_name":"Process Optimization and Integration","score":0.007899999618530273,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/tardiness","display_name":"Tardiness","score":0.8373000025749207},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6547999978065491},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6348999738693237},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.6162999868392944},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6121000051498413},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5192999839782715},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4569999873638153},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.41280001401901245}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8373000025749207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7721999883651733},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6547999978065491},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6348999738693237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.625},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.6162999868392944},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6121000051498413},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4569999873638153},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.3483000099658966},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C2742236","wikidata":"https://www.wikidata.org/wiki/Q924713","display_name":"Efficient energy use","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.06542","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.06542","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.06542","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.06542","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.52146315574646,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,177],"investigate":[4],"the":[5,32,44,66,69,73,82,118,131,139,145,149,157,164],"Resource-Constrained":[6],"Project":[7],"Scheduling":[8],"Problem":[9],"(RCPSP)":[10],"with":[11,127,171,202],"Time-of-Use":[12],"(TOU)":[13],"energy":[14,27,119],"tariffs":[15],"and":[16,34,61,72,104,192],"machine":[17,38],"states,":[18],"a":[19,98,105,114,128,179,211],"variant":[20],"of":[21,31,43,68],"RCPSP":[22,201],"for":[23],"production":[24],"scheduling,":[25],"where":[26],"price":[28],"is":[29,160],"part":[30],"criteria":[33],"one":[35,42],"highly":[36],"energy-demanding":[37],"can":[39,86],"be":[40],"in":[41,152,163],"following":[45],"three":[46],"states:":[47],"proc,":[48],"idle,":[49],"or":[50,210],"off.":[51],"The":[52,111],"problem":[53,116],"involves":[54],"scheduling":[55],"all":[56],"tasks,":[57],"respecting":[58],"precedence":[59],"constraints":[60],"resource":[62],"limitations,":[63],"while":[64],"minimizing":[65],"combination":[67],"overall":[70],"makespan":[71,158],"Total":[74],"Energy":[75],"Cost":[76],"(TEC),":[77],"which":[78,85],"varies":[79],"according":[80],"to":[81,95,168,173,181,186,195],"TOU":[83],"tariffs,":[84],"take":[87],"negative":[88],"values.":[89],"We":[90],"propose":[91,178],"two":[92],"novel":[93],"approaches":[94,137],"solve":[96],"it:":[97],"monolithic":[99,140,150],"Constraint":[100],"Programming":[101,125],"(CP)":[102],"approach":[103,185],"Logic-Based":[106],"Benders":[107],"Decomposition":[108],"(LBBD)":[109],"approach.":[110],"latter":[112],"combines":[113],"master":[115],"handling":[117,130],"cost":[120],"solved":[121],"using":[122,134],"Integer":[123],"Linear":[124],"(ILP)":[126],"subproblem":[129],"RCPSP,":[132],"resolved":[133],"CP.":[135],"Both":[136],"outperform":[138],"compact":[141],"ILP":[142],"counterpart,":[143],"but":[144],"LBBD":[146,184],"significantly":[147],"outperforms":[148],"CP":[151],"most":[153],"cases,":[154],"especially":[155],"when":[156],"criterion":[159],"not":[161],"included":[162],"objective":[165],"function,":[166],"solving":[167],"optimality":[169],"instances":[170],"up":[172],"480":[174],"tasks.":[175],"Finally,":[176],"way":[180],"generalize":[182],"our":[183],"other":[187],"problems":[188],"sharing":[189],"similar":[190],"characteristics,":[191],"applied":[193],"it":[194],"various":[196],"problems,":[197],"such":[198],"as":[199],"an":[200],"blocking":[203],"times":[204],"&":[205],"total":[206],"weighted":[207],"tardiness":[208],"criterion,":[209],"flexible":[212],"job":[213],"shop.":[214]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-14T00:00:00"}