{"id":"https://openalex.org/W4236217876","doi":"https://doi.org/10.1017/s0021900200009281","title":"Sample Path Optimal Policies for Serial Lines with Flexible Workers","display_name":"Sample Path Optimal Policies for Serial Lines with Flexible Workers","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W4236217876","doi":"https://doi.org/10.1017/s0021900200009281"},"language":"en","primary_location":{"id":"doi:10.1017/s0021900200009281","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200009281","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2FFBCCA3051D92939C25D77FB7F0E3E4/S0021900200009281a.pdf/div-class-title-sample-path-optimal-policies-for-serial-lines-with-flexible-workers-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2FFBCCA3051D92939C25D77FB7F0E3E4/S0021900200009281a.pdf/div-class-title-sample-path-optimal-policies-for-serial-lines-with-flexible-workers-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019190593","display_name":"Dimitrios G. Pandelis","orcid":null},"institutions":[{"id":"https://openalex.org/I145722265","display_name":"University of Thessaly","ror":"https://ror.org/04v4g9h31","country_code":"GR","type":"education","lineage":["https://openalex.org/I145722265"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Dimitrios G. Pandelis","raw_affiliation_strings":["University of Thessaly"],"affiliations":[{"raw_affiliation_string":"University of Thessaly","institution_ids":["https://openalex.org/I145722265"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079822409","display_name":"Mark P. Van Oyen","orcid":"https://orcid.org/0000-0002-8685-7843"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark P. Van Oyen","raw_affiliation_strings":["University of Michigan"],"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019190593","https://openalex.org/A5079822409"],"corresponding_institution_ids":["https://openalex.org/I145722265","https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62946268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"49","issue":"02","first_page":"582","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9988999962806702,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9951000213623047,"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/upstream","display_name":"Upstream (networking)","score":0.6903638243675232},{"id":"https://openalex.org/keywords/downstream","display_name":"Downstream (manufacturing)","score":0.6788309216499329},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6588165163993835},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6307979822158813},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.6286674737930298},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6017288565635681},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5618696808815002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46933072805404663},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.45888620615005493},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.432728111743927},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4225016236305237},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.4001538157463074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2917882204055786},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20471537113189697},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16180753707885742},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1565333902835846},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1412486732006073},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13136744499206543},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.12421268224716187},{"id":"https://openalex.org/keywords/management","display_name":"Management","score":0.084686279296875}],"concepts":[{"id":"https://openalex.org/C191172861","wikidata":"https://www.wikidata.org/wiki/Q7899321","display_name":"Upstream (networking)","level":2,"score":0.6903638243675232},{"id":"https://openalex.org/C2776207758","wikidata":"https://www.wikidata.org/wiki/Q5303302","display_name":"Downstream (manufacturing)","level":2,"score":0.6788309216499329},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6588165163993835},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6307979822158813},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.6286674737930298},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6017288565635681},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5618696808815002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46933072805404663},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.45888620615005493},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.432728111743927},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4225016236305237},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.4001538157463074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2917882204055786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20471537113189697},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16180753707885742},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1565333902835846},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1412486732006073},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13136744499206543},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.12421268224716187},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.084686279296875},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0021900200009281","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200009281","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2FFBCCA3051D92939C25D77FB7F0E3E4/S0021900200009281a.pdf/div-class-title-sample-path-optimal-policies-for-serial-lines-with-flexible-workers-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0021900200009281","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0021900200009281","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2FFBCCA3051D92939C25D77FB7F0E3E4/S0021900200009281a.pdf/div-class-title-sample-path-optimal-policies-for-serial-lines-with-flexible-workers-div.pdf","source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6700000166893005}],"awards":[{"id":"https://openalex.org/G10393649","display_name":"Hospital Systems Occupancy Prediction and Control to Increase Access, Smooth Provider Workload, and Reduce Cost","funder_award_id":"1068638","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4235204413","display_name":"Collaborative Research: A Design Methodology for Operational Flexibility","funder_award_id":"0542063","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5954070948","display_name":null,"funder_award_id":"CMMI-","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4236217876.pdf","grobid_xml":"https://content.openalex.org/works/W4236217876.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W2003284111","https://openalex.org/W2014774334","https://openalex.org/W2035133025","https://openalex.org/W2036955862","https://openalex.org/W2056208634","https://openalex.org/W2057181384","https://openalex.org/W2075543321","https://openalex.org/W2094772745","https://openalex.org/W2113307188","https://openalex.org/W2123361875","https://openalex.org/W2125250181","https://openalex.org/W2137430219","https://openalex.org/W2157916406","https://openalex.org/W2164129489","https://openalex.org/W2167738349","https://openalex.org/W2174715252"],"related_works":["https://openalex.org/W2059068483","https://openalex.org/W2379450806","https://openalex.org/W2375360707","https://openalex.org/W1513811401","https://openalex.org/W2375962308","https://openalex.org/W1867587390","https://openalex.org/W4236217876","https://openalex.org/W2014517934","https://openalex.org/W2753611853","https://openalex.org/W2046407444"],"abstract_inverted_index":{"We":[0,81],"study":[1],"the":[2,25,54,89,92,100],"dynamic":[3],"assignment":[4],"of":[5,34,49,76],"cross-trained":[6],"workers":[7,65],"in":[8,91],"serial":[9],"production":[10],"lines":[11],"characterized":[12],"by":[13,60],"stochastic":[14],"process":[15],"times":[16],"and":[17,97],"inventory":[18],"buffers":[19],"between":[20],"stations.":[21],"Throughput":[22],"maximization":[23],"is":[24,29,38],"objective.":[26],"Each":[27],"worker":[28,44,78,86],"trained":[30,45],"for":[31,46],"a":[32,47,85,109],"subset":[33],"tasks,":[35],"where":[36],"emphasis":[37],"placed":[39],"on":[40],"systems":[41],"with":[42,51],"each":[43],"zone":[48,55],"stations":[50,52],"near":[53],"boundaries":[56],"being":[57],"served":[58],"(shared)":[59],"one":[61],"or":[62],"more":[63],"other":[64],"as":[66],"well.":[67],"Using":[68],"sample":[69],"path":[70],"comparisons,":[71],"we":[72],"identify":[73,82],"structural":[74],"properties":[75],"optimal":[77],"allocation":[79],"policies.":[80],"when":[83],"(i)":[84],"can":[87],"prioritize":[88],"job":[90],"most":[93],"downstream":[94,101],"station":[95],"(last-buffer-first-served),":[96],"(ii)":[98],"only":[99],"(as":[102],"opposed":[103],"to":[104],"upstream)":[105],"server":[106],"should":[107],"serve":[108],"single":[110],"task.":[111]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}