On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System
dc.contributor.author | Kaufman, David L. | en_US |
dc.contributor.author | Ahn, Hyun-Soo | en_US |
dc.contributor.author | Lewis, Mark E. | en_US |
dc.date.accessioned | 2006-09-11T19:13:50Z | |
dc.date.available | 2006-09-11T19:13:50Z | |
dc.date.issued | 2005-10 | en_US |
dc.identifier.citation | Kaufman, David L.; Ahn, Hyun-soo; Lewis, Mark E.; (2005). "On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System." Queueing Systems 51 (1-2): 135-171. <http://hdl.handle.net/2027.42/47647> | en_US |
dc.identifier.issn | 0257-0130 | en_US |
dc.identifier.issn | 1572-9443 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47647 | |
dc.description.abstract | We consider a two-station tandem queueing system where customers arrive according to a Poisson process and must receive service at both stations before leaving the system. Neither queue is equipped with dedicated servers. Instead, we consider three scenarios for the fluctuations of workforce level. In the first, a decision-maker can increase and decrease the capacity as is deemed appropriate; the unrestricted case. In the other two cases, workers arrive randomly and can be rejected or allocated to either station. In one case the number of workers can then be reduced (the controlled capacity reduction case). In the other they leave randomly (the uncontrolled capacity reduction case). All servers are capable of working collaboratively on a single job and can work at either station as long as they remain in the system. We show in each scenario that all workers should be allocated to one queue or the other (never split between queues) and that they should serve exhaustively at one of the queues depending on the direction of an inequality. This extends previous studies on flexible systems to the case where the capacity varies over time. We then show in the unrestricted case that the optimal number of workers to have in the system is non-decreasing in the number of customers in either queue. | en_US |
dc.format.extent | 347998 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science + Business Media, Inc. | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Computer Communication Networks | en_US |
dc.subject.other | Systems Theory, Control | en_US |
dc.subject.other | Probability Theory and Stochastic Processes | en_US |
dc.subject.other | Operations Research/Decision Theory | en_US |
dc.subject.other | Production/Logistics | en_US |
dc.subject.other | Queues and Service | en_US |
dc.subject.other | Scheduling Theory | en_US |
dc.subject.other | Stochastic | en_US |
dc.title | On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, University of Michigan, 1205 Beal Avenue, Ann Arbor, Michigan, 48109-2117 | en_US |
dc.contributor.affiliationum | Operations and Management Science, Ross School of Business, University of Michigan, 701 Tappan Street, Ann Arbor, Michigan, 48109-1234 | en_US |
dc.contributor.affiliationother | School of Operations Research and Industrial Engineering, Cornell University, 206 Rhodes Hall, Ithaca, New York, 14853 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47647/1/11134_2005_Article_2441.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s11134-005-2441-x | en_US |
dc.identifier.source | Queueing Systems | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.