{"id":"https://openalex.org/W2136458005","doi":"https://doi.org/10.1007/s10951-010-0191-z","title":"Using column generation to solve parallel machine scheduling problems with minmax objective functions","display_name":"Using column generation to solve parallel machine scheduling problems with minmax objective functions","publication_year":2010,"publication_date":"2010-08-10","ids":{"openalex":"https://openalex.org/W2136458005","doi":"https://doi.org/10.1007/s10951-010-0191-z","mag":"2136458005"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-010-0191-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-010-0191-z","pdf_url":null,"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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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://doi.org/10.1007/s10951-010-0191-z","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063687361","display_name":"Marjan van den Akker","orcid":"https://orcid.org/0000-0002-7114-0655"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"J. M. van\u00a0den Akker","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80089, 3508 TB, Utrecht, The Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007204231","display_name":"J.A. Hoogeveen","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"J. A. Hoogeveen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80089, 3508 TB, Utrecht, The Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090392692","display_name":"J. W. van Kempen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125703","display_name":"Revenue Management Solutions (United States)","ror":"https://ror.org/02zkb9v82","country_code":"US","type":"company","lineage":["https://openalex.org/I4210125703"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. W. van Kempen","raw_affiliation_strings":["KLM Royal Dutch Airlines, Pricing and Revenue Management (AMS/RX), P.O. Box 7700, 1117 ZL, Schiphol Airport, The Netherlands","Pricing and Revenue Management (AMS/RX)"],"affiliations":[{"raw_affiliation_string":"KLM Royal Dutch Airlines, Pricing and Revenue Management (AMS/RX), P.O. Box 7700, 1117 ZL, Schiphol Airport, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Pricing and Revenue Management (AMS/RX)","institution_ids":["https://openalex.org/I4210125703"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063687361"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.22210453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"6","first_page":"801","last_page":"810"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9919999837875366,"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/column-generation","display_name":"Column generation","score":0.8129228353500366},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8043514490127563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7253175377845764},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7165553569793701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6130700707435608},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.569513201713562},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5321881771087646},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5067389607429504},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4398006796836853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37815070152282715}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.8129228353500366},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8043514490127563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7253175377845764},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7165553569793701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6130700707435608},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.569513201713562},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5321881771087646},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5067389607429504},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4398006796836853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37815070152282715},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":1,"locations":[{"id":"doi:10.1007/s10951-010-0191-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-010-0191-z","pdf_url":null,"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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10951-010-0191-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-010-0191-z","pdf_url":null,"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-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W37124424","https://openalex.org/W175434507","https://openalex.org/W573232330","https://openalex.org/W1488422606","https://openalex.org/W1490499382","https://openalex.org/W1535560884","https://openalex.org/W1940732572","https://openalex.org/W1964701519","https://openalex.org/W1965004458","https://openalex.org/W1992198745","https://openalex.org/W2010997912","https://openalex.org/W2060552317","https://openalex.org/W2065427999","https://openalex.org/W2107216979","https://openalex.org/W2120350145","https://openalex.org/W2124714712","https://openalex.org/W2124864047","https://openalex.org/W2920966226","https://openalex.org/W3044911583","https://openalex.org/W6721783347"],"related_works":["https://openalex.org/W2060052838","https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2005926129","https://openalex.org/W2061573764","https://openalex.org/W2255015247","https://openalex.org/W2964309041","https://openalex.org/W4298221171","https://openalex.org/W2101999355","https://openalex.org/W2968742484"],"abstract_inverted_index":{"In":[0],"this":[1,96,111],"paper":[2],"we":[3,42,64,77],"consider":[4],"the":[5,16,44,59,74],"parallel":[6],"machine":[7],"scheduling":[8],"problem":[9,49],"of":[10,15,46,61],"minimizing":[11],"an":[12],"objective":[13,91],"function":[14,92],"minmax":[17],"type,":[18],"like":[19],"maximum":[20],"lateness,":[21],"subject":[22],"to":[23,36,54,66,79,95,119,124],"release":[24],"dates,":[25],"deadlines,":[26],"and/or":[27],"generalized":[28],"precedence":[29],"constraints.":[30],"We":[31,116],"use":[32],"a":[33,38,47,56,81,87],"destructive":[34],"strategy":[35],"compute":[37,55],"lower":[39,75,97,105],"bound.":[40,98],"Here":[41],"test":[43],"feasibility":[45],"decision":[48],"by":[50,85],"applying":[51],"column":[52],"generation":[53],"bound":[57,84,106],"on":[58,133],"number":[60],"machines":[62,129],"that":[63,103,110],"need":[65],"feasibly":[67],"accommodate":[68],"all":[69],"jobs.":[70],"After":[71],"having":[72],"derived":[73],"bound,":[76],"try":[78],"find":[80],"matching":[82],"upper":[83],"identifying":[86],"feasible":[88],"schedule":[89],"with":[90,122],"value":[93],"equal":[94],"Our":[99],"computational":[100],"results":[101],"show":[102],"our":[104],"is":[107,112],"so":[108],"strong":[109],"almost":[113],"always":[114],"possible.":[115],"are":[117],"able":[118],"solve":[120],"problems":[121],"up":[123],"160":[125],"jobs":[126],"and":[127],"10":[128,131],"in":[130],"minutes":[132],"average.":[134]},"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},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}