Cross-Utilization of Workers Whose Capabilities Differ
This paper develops a model for allocating cross-trained workers at the beginning of a shift in a multidepartment service environment. It assumes departments are trying to maximize objective functions that are concave with respect to the number of workers assigned. Worker capabilities are described by parameters that range from zero to one, with fractional values representing workers who are less than fully qualified. The nonlinear programming model presented is a variant of the generalized assignment problem. The model is used in a series of experiments to investigate the value of cross-utilization as a function of factors such as demand variability and levels of cross-training. Results show that the benefits of cross-utilization can be substantial, and in many cases a small degree of cross-training can capture most of the benefits. Beyond a certain amount additional cross-training adds little additional value, and the preferred amount depends heavily on the level of demand variability.
Volume (Year): 45 (1999)
Issue (Month): 5 (May)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Fred F. Easton & Donald F. Rossin, 1991. "Sufficient Working Subsets for the Tour Scheduling Problem," Management Science, INFORMS, vol. 37(11), pages 1441-1451, November.
- Turgut Aykin, 1996. "Optimal Shift Scheduling with Multiple Break Windows," Management Science, INFORMS, vol. 42(4), pages 591-602, April.
- Siferd, Sue Perrott & Benton, W. C., 1992. "Workforce staffing and scheduling: Hospital nursing specific models," European Journal of Operational Research, Elsevier, vol. 60(3), pages 233-246, August.
- Ahmad I. Z. Jarrah & Jonathan F. Bard & Anura H. deSilva, 1994. "Solving Large-Scale Tour Scheduling Problems," Management Science, INFORMS, vol. 40(9), pages 1124-1144, September.
- Vandankumar M. Trivedi & D. Michael Warner, 1976. "A Branch and Bound Algorithm for Optimum Allocation of Float Nurses," Management Science, INFORMS, vol. 22(9), pages 972-981, May.
- D. Michael Warner & Juan Prawda, 1972. "A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital," Management Science, INFORMS, vol. 19(4-Part-1), pages 411-422, December.
- Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
- Gary M. Thompson, 1995. "Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem," Management Science, INFORMS, vol. 41(4), pages 595-607, April.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:5:p:722-732. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.