{"id":"https://openalex.org/W4296899820","doi":"https://doi.org/10.1007/s10951-022-00750-w","title":"Packing-based branch-and-bound for discrete malleable task scheduling","display_name":"Packing-based branch-and-bound for discrete malleable task scheduling","publication_year":2022,"publication_date":"2022-09-22","ids":{"openalex":"https://openalex.org/W4296899820","doi":"https://doi.org/10.1007/s10951-022-00750-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-022-00750-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-022-00750-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-022-00750-w.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10951-022-00750-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088742299","display_name":"Roland Braune","orcid":"https://orcid.org/0000-0003-4086-229X"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Roland Braune","raw_affiliation_strings":["Department of Business Decisions and Analytics, Josef Ressel Center for Adaptive Optimization in Dynamic Environments, University of Vienna, Oskar-Morgenstern-Platz 1, 1090, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0003-4086-229X","affiliations":[{"raw_affiliation_string":"Department of Business Decisions and Analytics, Josef Ressel Center for Adaptive Optimization in Dynamic Environments, University of Vienna, Oskar-Morgenstern-Platz 1, 1090, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088742299"],"corresponding_institution_ids":["https://openalex.org/I129774422"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.3395,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63117957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"6","first_page":"675","last_page":"704"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.698080837726593},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6323767900466919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5462590456008911},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.5315375924110413},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5299136638641357},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5254313349723816},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5219618678092957},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49037861824035645},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4807991087436676},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44891366362571716},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43167775869369507},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4122193455696106},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.41153115034103394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37792736291885376},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3541671335697174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25690844655036926},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.23362833261489868},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.19858181476593018}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.698080837726593},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6323767900466919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5462590456008911},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5315375924110413},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5299136638641357},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5254313349723816},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5219618678092957},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49037861824035645},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4807991087436676},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44891366362571716},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43167775869369507},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4122193455696106},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.41153115034103394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37792736291885376},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3541671335697174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25690844655036926},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.23362833261489868},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.19858181476593018},{"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.1007/s10951-022-00750-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-022-00750-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-022-00750-w.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jsched:v:25:y:2022:i:6:d:10.1007_s10951-022-00750-w","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10951-022-00750-w","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10951-022-00750-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-022-00750-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-022-00750-w.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311813","display_name":"\u00d6sterreichische Nationalstiftung f\u00fcr Forschung, Technologie und Entwicklung","ror":"https://ror.org/04hb33h70"},{"id":"https://openalex.org/F4320321691","display_name":"Universit\u00e4t Wien","ror":"https://ror.org/03prydq77"},{"id":"https://openalex.org/F4320323591","display_name":"Christian Doppler Forschungsgesellschaft","ror":"https://ror.org/00mv8h305"},{"id":"https://openalex.org/F4320327593","display_name":"Bundesministerium f\u00fcr Digitalisierung und Wirtschaftsstandort","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4296899820.pdf","grobid_xml":"https://content.openalex.org/works/W4296899820.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W98859305","https://openalex.org/W166751945","https://openalex.org/W181877901","https://openalex.org/W254944847","https://openalex.org/W1488422606","https://openalex.org/W1515176649","https://openalex.org/W1856880495","https://openalex.org/W1879823070","https://openalex.org/W1984223094","https://openalex.org/W2007684460","https://openalex.org/W2013843202","https://openalex.org/W2019133545","https://openalex.org/W2023044784","https://openalex.org/W2023550293","https://openalex.org/W2025787252","https://openalex.org/W2044262424","https://openalex.org/W2058653357","https://openalex.org/W2068886975","https://openalex.org/W2075680614","https://openalex.org/W2082595031","https://openalex.org/W2089205020","https://openalex.org/W2101848567","https://openalex.org/W2104166288","https://openalex.org/W2108097679","https://openalex.org/W2125886152","https://openalex.org/W2126559728","https://openalex.org/W2139936806","https://openalex.org/W2150498383","https://openalex.org/W2158214373","https://openalex.org/W2162535720","https://openalex.org/W2169146618","https://openalex.org/W2277678953","https://openalex.org/W2342137734","https://openalex.org/W2404973837","https://openalex.org/W2606364423","https://openalex.org/W2614184260","https://openalex.org/W2802400846","https://openalex.org/W2897983212","https://openalex.org/W2963964677","https://openalex.org/W3134267570"],"related_works":["https://openalex.org/W2057295499","https://openalex.org/W2183981361","https://openalex.org/W1790513731","https://openalex.org/W2045607085","https://openalex.org/W2049602716","https://openalex.org/W2142524277","https://openalex.org/W2162284428","https://openalex.org/W2044260124","https://openalex.org/W2052110143","https://openalex.org/W2106024144"],"abstract_inverted_index":{"Abstract":[0],"This":[1,45],"paper":[2],"addresses":[3],"the":[4,50,59,111,128,144],"problem":[5,51,90],"of":[6,10,20,52,63,68,110,155,166],"scheduling":[7,89],"chain-like":[8],"structures":[9],"tasks":[11,30],"on":[12,117],"a":[13,92,131,151],"single":[14],"multiprocessor":[15],"resource.":[16],"In":[17,136],"fact,":[18],"sub-tasks":[19,57],"unit-time":[21],"length":[22],"and":[23,77,91,105,130,140],"predefined":[24],"size":[25],"are":[26,162],"aggregated":[27],"to":[28,33,40,138,149,164],"composite":[29],"that":[31,161],"have":[32],"be":[34],"scheduled":[35],"without":[36],"preemption,":[37],"but":[38],"subject":[39],"flexibility":[41],"concerning":[42],"resource":[43],"allocation.":[44,64],"setting":[46],"most":[47],"closely":[48],"resembles":[49],"malleable":[53],"task":[54],"scheduling,":[55],"with":[56,75],"being":[58],"smallest":[60],"atomic":[61],"unit":[62],"The":[65,108],"specific":[66],"type":[67],"malleability":[69],"is":[70,85,97,114,147],"realized":[71],"using":[72],"precedence":[73],"constraints":[74],"minimum":[76],"maximum":[78],"time":[79],"lags.":[80],"A":[81],"bin":[82],"packing":[83],"model":[84],"established":[86],"for":[87],"this":[88],"corresponding,":[93],"dedicated":[94],"branch-and-bound":[95],"algorithm":[96],"devised,":[98],"alongside":[99],"problem-specific":[100],"bound":[101],"tightening,":[102],"symmetry":[103],"breaking":[104],"dominance":[106],"concepts.":[107],"efficacy":[109],"solution":[112],"approach":[113],"demonstrated":[115],"based":[116],"extensive":[118],"computational":[119],"experiments,":[120],"including":[121],"randomized":[122],"instances,":[123],"adapted":[124],"benchmark":[125],"instances":[126],"from":[127],"literature,":[129],"small":[132],"real-world":[133],"data":[134],"set.":[135],"comparison":[137],"mixed-integer":[139],"constraint":[141],"programming":[142],"formulations,":[143],"new":[145],"method":[146],"able":[148],"achieve":[150],"considerably":[152],"higher":[153],"percentage":[154],"optimal":[156],"solutions":[157],"at":[158],"computation":[159],"times":[160],"up":[163],"orders":[165],"magnitude":[167],"smaller.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-12T07:12:00.856984","created_date":"2025-10-10T00:00:00"}