{"id":"https://openalex.org/W2519240870","doi":"https://doi.org/10.1109/hpcsim.2016.7568331","title":"Increasing waiting time satisfaction in parallel job scheduling via a flexible MILP approach","display_name":"Increasing waiting time satisfaction in parallel job scheduling via a flexible MILP approach","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2519240870","doi":"https://doi.org/10.1109/hpcsim.2016.7568331","mag":"2519240870"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2016.7568331","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","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/A5047918757","display_name":"Stephan Schlagkamp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116723","display_name":"Robotics Research (United States)","ror":"https://ror.org/020w2fr77","country_code":"US","type":"company","lineage":["https://openalex.org/I4210116723"]},{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Stephan Schlagkamp","raw_affiliation_strings":["Robotics Research Institute, TU Dortmund University"],"affiliations":[{"raw_affiliation_string":"Robotics Research Institute, TU Dortmund University","institution_ids":["https://openalex.org/I4210116723","https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010329055","display_name":"Matthias Hofmann","orcid":"https://orcid.org/0000-0003-4107-7197"},"institutions":[{"id":"https://openalex.org/I4210116723","display_name":"Robotics Research (United States)","ror":"https://ror.org/020w2fr77","country_code":"US","type":"company","lineage":["https://openalex.org/I4210116723"]},{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Matthias Hofmann","raw_affiliation_strings":["Robotics Research Institute, TU Dortmund University"],"affiliations":[{"raw_affiliation_string":"Robotics Research Institute, TU Dortmund University","institution_ids":["https://openalex.org/I4210116723","https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029459922","display_name":"Lars Eufinger","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lars Eufinger","raw_affiliation_strings":["Institute of Transport Logistics, TU Dortmund University"],"affiliations":[{"raw_affiliation_string":"Institute of Transport Logistics, TU Dortmund University","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072339196","display_name":"Rafael Ferreira da Silva","orcid":"https://orcid.org/0000-0002-1720-0928"},"institutions":[{"id":"https://openalex.org/I903300897","display_name":"Southern States University","ror":"https://ror.org/01b0j0m34","country_code":"US","type":"education","lineage":["https://openalex.org/I903300897"]},{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rafael Ferreira da Silva","raw_affiliation_strings":["Information Science Institute, University of Southern California"],"affiliations":[{"raw_affiliation_string":"Information Science Institute, University of Southern California","institution_ids":["https://openalex.org/I903300897","https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047918757"],"corresponding_institution_ids":["https://openalex.org/I200332995","https://openalex.org/I4210116723"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78867981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"37","issue":null,"first_page":"164","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7641149759292603},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6276911497116089},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6160957217216492},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5391604900360107},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5337632298469543},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5162106156349182},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5126211047172546},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.502032995223999},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.46956825256347656},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.46918535232543945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16580495238304138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09125813841819763},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07845374941825867},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07255673408508301},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.05645361542701721}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7641149759292603},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6276911497116089},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6160957217216492},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5391604900360107},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5337632298469543},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5162106156349182},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5126211047172546},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.502032995223999},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.46956825256347656},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.46918535232543945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16580495238304138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09125813841819763},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07845374941825867},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07255673408508301},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.05645361542701721},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2016.7568331","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338284","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W180765255","https://openalex.org/W653291314","https://openalex.org/W1488422606","https://openalex.org/W1513326124","https://openalex.org/W1565502159","https://openalex.org/W1859126261","https://openalex.org/W1944778298","https://openalex.org/W1963547452","https://openalex.org/W1980189995","https://openalex.org/W2016395505","https://openalex.org/W2089636653","https://openalex.org/W2103808595","https://openalex.org/W2111556044","https://openalex.org/W2120542827","https://openalex.org/W2122967269","https://openalex.org/W2144559343","https://openalex.org/W2150074609","https://openalex.org/W2202483651","https://openalex.org/W2219413783","https://openalex.org/W2258721404","https://openalex.org/W2285567374","https://openalex.org/W2338973660","https://openalex.org/W2418418119","https://openalex.org/W2476771389","https://openalex.org/W2518760778","https://openalex.org/W2735502438","https://openalex.org/W4213255380","https://openalex.org/W6607303267","https://openalex.org/W6621670942","https://openalex.org/W6678371554","https://openalex.org/W6741356249","https://openalex.org/W6996888795"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W2225350526","https://openalex.org/W2397293317","https://openalex.org/W4390722068"],"abstract_inverted_index":{"Scheduling":[0],"of":[1,50,62,72,90,137],"jobs":[2],"in":[3,93],"parallel":[4,33,54],"computing":[5],"is":[6,38,81],"crucial":[7],"to":[8,40,68,111],"efficiently":[9],"use":[10,89],"shared":[11],"resources,":[12],"while":[13],"attaining":[14],"user":[15],"satisfaction.":[16,116],"In":[17],"this":[18],"paper,":[19],"we":[20,46,118],"evaluate":[21],"how":[22],"mixed-integer":[23],"linear":[24,70],"programming":[25],"(MILP)":[26],"can":[27],"be":[28,41],"applied":[29],"for":[30,53],"the":[31,48,63,69,77,125,134],"online":[32,135],"job":[34,55,138],"scheduling":[35,65,79,127],"problem":[36],"(which":[37],"well-known":[39],"an":[42],"NP-complete":[43],"problem).":[44],"Therefore,":[45],"introduce":[47],"idea":[49],"planning":[51],"horizons":[52],"scheduling,":[56],"and":[57,97,105],"provide":[58],"a":[59,94],"MILP":[60,74,122],"formulation":[61,123],"targeted":[64],"problem.":[66],"Due":[67],"fashion":[71],"possible":[73],"objective":[75],"functions,":[76],"proposed":[78],"algorithm":[80],"flexible":[82],"towards":[83],"different":[84],"optimization":[85],"goals.":[86],"We":[87],"make":[88],"data":[91],"collected":[92],"user-based":[95],"study":[96],"workload":[98],"traces":[99],"from":[100],"two":[101],"real":[102],"production":[103],"systems,":[104],"demonstrate":[106],"that":[107,120],"our":[108,121],"approach":[109],"suffices":[110],"increase":[112],"users'":[113],"waiting":[114],"time":[115],"Additionally,":[117],"show":[119],"outperforms":[124],"EASY":[126],"technique":[128],"with":[129],"conservative":[130],"backfilling,":[131],"when":[132],"neglecting":[133],"character":[136],"submissions.":[139]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}