An algorithm for single shift scheduling of hierarchical workforce
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- R. N. Burns & M. W. Carter, 1985. "Work Force Size and Single Shift Schedules with Variable Demands," Management Science, INFORMS, vol. 31(5), pages 599-607, May.
- William S. Brownell & James M. Lowerre, 1976. "Scheduling of Work Forces Required in Continuous Operations Under Alternative Labor Policies," Management Science, INFORMS, vol. 22(5), pages 597-605, January.
- R. N. Burns & G. J. Koop, 1987. "A Modular Approach to Optimal Multiple-Shift Manpower Scheduling," Operations Research, INFORMS, vol. 35(1), pages 100-110, February.
- Hamilton Emmons & Richard N. Burns, 1991. "Off-Day Scheduling with Hierarchical Worker Categories," Operations Research, INFORMS, vol. 39(3), pages 484-495, June.
- Kenneth R. Baker & Michael J. Magazine, 1977. "Workforce Scheduling with Cyclic Demands and Day-Off Constraints," Management Science, INFORMS, vol. 24(2), pages 161-167, October.
- James M. Lowerre, 1977. "Work Stretch Properties for the Scheduling of Continuous Operations Under Alternative Labor Policies," Management Science, INFORMS, vol. 23(9), pages 963-971, May.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ağralı, Semra & Taşkın, Z. Caner & Ünal, A. Tamer, 2017. "Employee scheduling in service industries with flexible employee availability and demand," Omega, Elsevier, vol. 66(PA), pages 159-169.
- Cai, X. & Li, K. N., 2000. "A genetic algorithm for scheduling staff of mixed skills under multi-criteria," European Journal of Operational Research, Elsevier, vol. 125(2), pages 359-369, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
- Broos Maenhout & Mario Vanhoucke, 2017. "A resource type analysis of the integrated project scheduling and personnel staffing problem," Annals of Operations Research, Springer, vol. 252(2), pages 407-433, May.
- Hertz, Alain & Lahrichi, Nadia & Widmer, Marino, 2010. "A flexible MILP model for multiple-shift workforce planning under annualized hours," European Journal of Operational Research, Elsevier, vol. 200(3), pages 860-873, February.
- Azmat, Carlos S. & Widmer, Marino, 2004. "A case study of single shift planning and scheduling under annualized hours: A simple three-step approach," European Journal of Operational Research, Elsevier, vol. 153(1), pages 148-175, February.
- Hung, Rudy, 2006. "Using compressed workweeks to save labour cost," European Journal of Operational Research, Elsevier, vol. 170(1), pages 319-322, April.
- Rudy Hung, 1999. "A multiple‐shift workforce scheduling model under annualized hours," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 726-736, September.
- Richard N. Burns & Rangarajan Narasimhan & L. Douglas Smith, 1998. "A set‐processing algorithm for scheduling staff on 4‐day or 3‐day work weeks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 839-853, December.
- Brusco, Michael J. & Johns, Tony R., 1996. "A sequential integer programming method for discontinuous labor tour scheduling," European Journal of Operational Research, Elsevier, vol. 95(3), pages 537-548, December.
- G Laporte & G Pesant, 2004. "A general multi-shift scheduling system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1208-1217, November.
- Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
- Andreas Fügener & Jens O. Brunner, 2019. "Planning for Overtime: The Value of Shift Extensions in Physician Scheduling," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 732-744, October.
- Jens O. Brunner & Jonathan F. Bard & Jan M. Köhler, 2013. "Bounded flexibility in days‐on and days‐off scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 678-701, December.
- Brusco, Michael J. & Jacobs, Larry W., 1995. "Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations," European Journal of Operational Research, Elsevier, vol. 86(2), pages 249-261, October.
- Yann Ferrand & Michael Magazine & Uday S. Rao & Todd F. Glass, 2011. "Building Cyclic Schedules for Emergency Department Physicians," Interfaces, INFORMS, vol. 41(6), pages 521-533, December.
- Cipriano Santos & Tere Gonzalez & Haitao Li & Kay-Yut Chen & Dirk Beyer & Sundaresh Biligi & Qi Feng & Ravindra Kumar & Shelen Jain & Ranga Ramanujam & Alex Zhang, 2013. "HP Enterprise Services Uses Optimization for Resource Planning," Interfaces, INFORMS, vol. 43(2), pages 152-169, April.
- Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
- Maenhout, Broos & Vanhoucke, Mario, 2013. "An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems," Omega, Elsevier, vol. 41(2), pages 485-499.
- Jaumard, Brigitte & Semet, Frederic & Vovor, Tsevi, 1998. "A generalized linear programming model for nurse scheduling," European Journal of Operational Research, Elsevier, vol. 107(1), pages 1-18, May.
- Elín Björk Böðvarsdóttir & Niels-Christian Fink Bagger & Laura Elise Høffner & Thomas J. R. Stidsen, 2022. "A flexible mixed integer programming-based system for real-world nurse rostering," Journal of Scheduling, Springer, vol. 25(1), pages 59-88, February.
- Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:96:y:1997:i:1:p:113-121. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.