{"id":"https://openalex.org/W1980844816","doi":"https://doi.org/10.1137/0222025","title":"Optimal Stochastic Allocation of Machines under Waiting-Time Constraints","display_name":"Optimal Stochastic Allocation of Machines under Waiting-Time Constraints","publication_year":1993,"publication_date":"1993-04-01","ids":{"openalex":"https://openalex.org/W1980844816","doi":"https://doi.org/10.1137/0222025","mag":"1980844816"},"language":"en","primary_location":{"id":"doi:10.1137/0222025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. G. Coffman, Jr.","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039754060","display_name":"Leopold Flatto","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leopold Flatto","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108373126","display_name":"Paul E. Wright","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul E. Wright","raw_affiliation_strings":["AT&T Bell Labs.,Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Labs.,Murray Hill, NJ","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1169,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85381559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"2","first_page":"332","last_page":"348"},"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5270761847496033},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5158100128173828},{"id":"https://openalex.org/keywords/optimal-allocation","display_name":"Optimal allocation","score":0.4255028963088989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29692673683166504}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5270761847496033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5158100128173828},{"id":"https://openalex.org/C3020013979","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimal allocation","level":2,"score":0.4255028963088989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29692673683166504}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0222025","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222025","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6200000047683716,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W86914669","https://openalex.org/W1587483668","https://openalex.org/W2045673997","https://openalex.org/W2315841162"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"The":[0,25,32,181,187],"nonpreemptive":[1],"scheduling":[2,97,137],"of":[3,16,27,35,52,77,118,194,211],"$n":[4,158],"\\geqslant":[5],"1$":[6],"stochastic":[7],"jobs":[8,37,104],"is":[9,30,88,139,142,154,164,179,184,207],"considered":[10],"to":[11,20,48,66,112,131,144,201],"minimize":[12],"the":[13,36,100,116,121,132,169,176,195],"expected":[14],"number":[15,26],"parallel":[17],"machines":[18,28],"needed":[19],"meet":[21],"given":[22],"waiting-time":[23],"constraints.":[24],"available":[29,113],"unlimited.":[31],"running":[33],"times":[34,64],"are":[38,46,65,110,129],"denoted":[39],"$T_1":[40,78,124],",":[41,79,125],"\\ldots":[42,80,126],",T_n":[43,81,127],"$":[44,128],"and":[45,95,120,153],"taken":[47],"be":[49,67,145],"independent":[50,76],"samples":[51],"an":[53,91,150,172,215],"exponentially":[54],"distributed":[55],"random":[56,73],"variable":[57,74],"T":[58],"with":[59,90,190],"mean":[60],"1.":[61],"Job":[62],"waiting":[63,106],"bounded":[68],"stochastically":[69],"by":[70],"a":[71,86,108,165,191,202],"nonnegative":[72],"W,":[75,94],"$.":[82],"At":[83],"time":[84],"zero,":[85],"timer":[87,101],"started":[89],"initial":[92],"value":[93],"job":[96,122],"begins.":[98],"When":[99],"expires,":[102],"all":[103],"still":[105],"for":[107,175],"machine":[109],"assigned":[111],"machines.":[114],"Only":[115],"distributions":[117],"W":[119,148,163],"durations":[123],"known":[130],"scheduler":[133],"in":[134],"advance.":[135],"A":[136,209],"policy":[138,203],"defined":[140],"which":[141,199],"proven":[143],"optimal":[146,156],"when":[147,162],"has":[149],"exponential":[151,170],"distribution,":[152],"asymptotically":[155],"as":[157],"\\to":[159],"\\infty":[160],"$,":[161],"constant":[166],"(hard-deadline).":[167],"In":[168],"case,":[171],"explicit":[173],"formula":[174],"cost":[177],"function":[178],"derived.":[180],"uniqueness":[182],"question":[183],"also":[185],"resolved.":[186],"paper":[188],"concludes":[189],"partial":[192],"analysis":[193],"general":[196],"hard-deadline":[197],"problem,":[198],"leads":[200],"that":[204],"we":[205],"think":[206],"optimal.":[208],"proof":[210],"optimality,":[212],"however,":[213],"remains":[214],"open":[216],"problem.":[217]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}