Flexibly serving a finite number of heterogeneous jobs in a tandem system

Many manufacturing and service systems require a finite number of heterogeneous jobs to be processed by two stations in tandem. Each station serves at most one job at a time and there is a finite buffer between the two stations. We consider two flexible servers that are cross-trained to work at both...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Yun Fong, LU, Bingnan, WANG, Rowan, ZHANG, Wenjia
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2020
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/6547
https://ink.library.smu.edu.sg/context/lkcsb_research/article/7546/viewcontent/FSFNHJTS_2_sv.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-7546
record_format dspace
spelling sg-smu-ink.lkcsb_research-75462020-09-11T02:38:36Z Flexibly serving a finite number of heterogeneous jobs in a tandem system LIM, Yun Fong LU, Bingnan WANG, Rowan ZHANG, Wenjia Many manufacturing and service systems require a finite number of heterogeneous jobs to be processed by two stations in tandem. Each station serves at most one job at a time and there is a finite buffer between the two stations. We consider two flexible servers that are cross-trained to work at both stations. The duration for a server to finish a job at a station is exponentially distributed with a rate that depends on the server, the station, and the job. Our goal is to identify an efficient policy to dynamically assign the servers to the stations such that the expected makespan (duration to complete all the jobs) is minimized. Given that an optimal policy is non-idling, we focus on non-idling policies. We first derive the expected makespan of a general non-idling policy. We then analyze three simple non-idling policies: the summation-myopic, the product-myopic, and the teamwork policies. We prove that (i) the product-myopic policy is optimal if the servers maintain the same service-rate ratio at each station for all the jobs, (ii) the teamwork policy is optimal if the servers maintain the same service-rate ratio at different stations for jobs that are sequenced near each other, and (iii) the summation-myopic policy is no worse than the teamwork policy. Our numerical study based on general service rates suggests that the summation-myopic policy can be better or worse than the product-myopic policy. We also extend the model to incorporate moving costs and service defects. 2020-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/6547 info:doi/10.1111/poms.13172 https://ink.library.smu.edu.sg/context/lkcsb_research/article/7546/viewcontent/FSFNHJTS_2_sv.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Manufacturing Service Work station Dynamic server assignment Productivity Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Manufacturing
Service
Work station
Dynamic server assignment
Productivity
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Manufacturing
Service
Work station
Dynamic server assignment
Productivity
Operations and Supply Chain Management
Operations Research, Systems Engineering and Industrial Engineering
LIM, Yun Fong
LU, Bingnan
WANG, Rowan
ZHANG, Wenjia
Flexibly serving a finite number of heterogeneous jobs in a tandem system
description Many manufacturing and service systems require a finite number of heterogeneous jobs to be processed by two stations in tandem. Each station serves at most one job at a time and there is a finite buffer between the two stations. We consider two flexible servers that are cross-trained to work at both stations. The duration for a server to finish a job at a station is exponentially distributed with a rate that depends on the server, the station, and the job. Our goal is to identify an efficient policy to dynamically assign the servers to the stations such that the expected makespan (duration to complete all the jobs) is minimized. Given that an optimal policy is non-idling, we focus on non-idling policies. We first derive the expected makespan of a general non-idling policy. We then analyze three simple non-idling policies: the summation-myopic, the product-myopic, and the teamwork policies. We prove that (i) the product-myopic policy is optimal if the servers maintain the same service-rate ratio at each station for all the jobs, (ii) the teamwork policy is optimal if the servers maintain the same service-rate ratio at different stations for jobs that are sequenced near each other, and (iii) the summation-myopic policy is no worse than the teamwork policy. Our numerical study based on general service rates suggests that the summation-myopic policy can be better or worse than the product-myopic policy. We also extend the model to incorporate moving costs and service defects.
format text
author LIM, Yun Fong
LU, Bingnan
WANG, Rowan
ZHANG, Wenjia
author_facet LIM, Yun Fong
LU, Bingnan
WANG, Rowan
ZHANG, Wenjia
author_sort LIM, Yun Fong
title Flexibly serving a finite number of heterogeneous jobs in a tandem system
title_short Flexibly serving a finite number of heterogeneous jobs in a tandem system
title_full Flexibly serving a finite number of heterogeneous jobs in a tandem system
title_fullStr Flexibly serving a finite number of heterogeneous jobs in a tandem system
title_full_unstemmed Flexibly serving a finite number of heterogeneous jobs in a tandem system
title_sort flexibly serving a finite number of heterogeneous jobs in a tandem system
publisher Institutional Knowledge at Singapore Management University
publishDate 2020
url https://ink.library.smu.edu.sg/lkcsb_research/6547
https://ink.library.smu.edu.sg/context/lkcsb_research/article/7546/viewcontent/FSFNHJTS_2_sv.pdf
_version_ 1770575215498100736