{"id":"https://openalex.org/W1966475537","doi":"https://doi.org/10.1137/s0097539702406388","title":"Minimizing Total Completion Time on Parallel Machines with Deadline Constraints","display_name":"Minimizing Total Completion Time on Parallel Machines with Deadline Constraints","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1966475537","doi":"https://doi.org/10.1137/s0097539702406388","mag":"1966475537"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702406388","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["1095-7111","0097-5397"],"is_oa":false,"is_in_doaj":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5049406194","display_name":"Y Joseph","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Y","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044975638","display_name":"Tim Leung","orcid":"https://orcid.org/0000-0002-0023-6289"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Leung","raw_affiliation_string":" New York University**","raw_affiliation_strings":[" New York University**"]},{"author_position":"last","author":{"id":"https://openalex.org/A5039562226","display_name":"Michael Pinedo","orcid":"https://orcid.org/0000-0001-7814-0642"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Pinedo","raw_affiliation_string":" New York University**","raw_affiliation_strings":[" New York University**"]}],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":19,"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":"32","issue":"5","first_page":"1370","last_page":"1388"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling Problems in Manufacturing Systems","score":0.9999,"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 Problems in Manufacturing Systems","score":0.9999,"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":"Distributed Coordination in Online Robotics Research","score":0.9985,"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 of Cutting and Packing Problems","score":0.9852,"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":[{"keyword":"total completion time","score":0.6573},{"keyword":"parallel machines","score":0.5758},{"keyword":"constraints","score":0.3061}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.636401},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6300765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6114554},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5148334},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47165123},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.46708724},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4554621},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44221917},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4224488},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4193818},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37587538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3334933},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33201677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29692614},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1922209},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19206297},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06654152}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702406388","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["1095-7111","0097-5397"],"is_oa":false,"is_in_doaj":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6}],"grants":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1980289219","https://openalex.org/W1988328380","https://openalex.org/W1994420771","https://openalex.org/W2000863312","https://openalex.org/W2058225986","https://openalex.org/W2058772464","https://openalex.org/W2058817479","https://openalex.org/W2126734353"],"related_works":["https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W2794663421","https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W3191866865","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284"],"ngrams_url":"https://api.openalex.org/works/W1966475537/ngrams","abstract_inverted_index":{"Consider":[0],"n":[1],"independent":[2],"jobs":[3,32,47],"and":[4,17,40,136,169],"m":[5,178],"identical":[6],"machines":[7],"in":[8,118,124],"parallel.":[9],"Job":[10],"j":[11],"has":[12],"a":[13,18,56,64,68,72,82,161],"processing":[14,25,36],"time":[15,38,89],"pj":[16],"deadline":[19],"$\\bar{d}_j$.":[20],"It":[21],"must":[22],"complete":[23],"its":[24,29],"before":[26],"or":[27,150],"at":[28,37],"deadline.":[30],"All":[31],"are":[33,42],"available":[34],"for":[35,164],"t=0":[39],"preemptions":[41],"allowed.":[43],"A":[44],"set":[45,74],"of":[46,75,121,129,148],"is":[48,66,79,104,154,189],"said":[49],"to":[50,80,106],"be":[51],"feasible":[52,69,73],"if":[53],"there":[54],"exists":[55],"schedule":[57,65,83],"that":[58,84,172],"meets":[59],"all":[60],"the":[61,86,93,119,130,146,152,173],"deadlines;":[62],"such":[63],"called":[67],"schedule.":[70],"Given":[71],"jobs,":[76],"our":[77],"goal":[78],"find":[81],"minimizes":[85],"total":[87],"completion":[88],"$\\sum":[90],"C_j$.":[91,114],"In":[92,156],"classical":[94],"$\\alpha":[95],"\\mid":[96,98,109,112,183,186],"\\beta":[97],"\\gamma$":[99],"scheduling":[100],"notation":[101],"this":[102,157],"problem":[103,153,176],"referred":[105],"as":[107],"$P":[108],"prmt,":[110,184],"\\bar{d}_j":[111,185],"\\sum":[113,187],"Lawler":[115],"(Recent":[116],"Results":[117],"Theory":[120],"Machine":[122],"Scheduling,":[123],"Mathematical":[125],"Programming:":[126],"The":[127],"State":[128],"Art,":[131],"A.":[132],"Bachem,":[133],"M.":[134],"Gr\u00f6tschel,":[135],"B.":[137],"Korte,":[138],"eds.,":[139],"Springer,":[140],"Berlin,":[141],"1982,":[142],"pp.":[143],"202-234)":[144],"raised":[145],"question":[147],"whether":[149],"not":[151],"NP-hard.":[155,191],"paper":[158],"we":[159,170],"present":[160],"polynomial-time":[162],"algorithm":[163],"every":[165],"$m":[166],"\\ge":[167],"2$,":[168],"show":[171],"more":[174],"general":[175],"with":[177],"unrelated":[179],"machines,":[180],"i.e.,":[181],"$R":[182],"C_j$,":[188],"strongly":[190]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1966475537","counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2024-03-21T18:33:32.528465","created_date":"2016-06-24"}