IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v128y2001i3p558-569.html
   My bibliography  Save this article

Modeling and algorithmic development of a staff scheduling problem

Author

Listed:
  • Sarin, Subhash C.
  • Aggarwal, Sanjay

Abstract

No abstract is available for this item.

Suggested Citation

  • Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.
    • Handle: RePEc:eee:ejores:v:128:y:2001:i:3:p:558-569
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00421-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. M. L. Balinski & R. E. Quandt, 1964. "On an Integer Program for a Delivery Problem," Operations Research, INFORMS, vol. 12(2), pages 300-304, April.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
    4. Charles Revelle & David Marks & Jon C. Liebman, 1970. "An Analysis of Private and Public Sector Location Models," Management Science, INFORMS, vol. 16(11), pages 692-707, July.
    5. Samuel Eilon & Nicos Christofides, 1971. "The Loading Problem," Management Science, INFORMS, vol. 17(5), pages 259-268, January.
    6. GARFINKEL, Robert S. & NEMHAUSER, Geroge L., 1970. "Optimal political districting by implicit enumeration techniques," LIDAM Reprints CORE 54, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Egon Balas & Manfred Padberg, 1975. "On the Set-Covering Problem: II. An Algorithm for Set Partitioning," Operations Research, INFORMS, vol. 23(1), pages 74-90, February.
    8. John F. Pierce & Jeffrey S. Lasky, 1973. "Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems," Management Science, INFORMS, vol. 19(5), pages 528-543, January.
    9. Roy E. Marsten, 1974. "An Algorithm for Large Set Partitioning Problems," Management Science, INFORMS, vol. 20(5), pages 774-787, January.
    10. R. S. Garfinkel & G. L. Nemhauser, 1969. "The Set-Partitioning Problem: Set Covering with Equality Constraints," Operations Research, INFORMS, vol. 17(5), pages 848-856, October.
    11. James G. Root, 1964. "An Application of Symbolic Logic to a Selection Problem," Operations Research, INFORMS, vol. 12(4), pages 519-526, August.
    12. R. S. Garfinkel & G. L. Nemhauser, 1970. "Optimal Political Districting by Implicit Enumeration Techniques," Management Science, INFORMS, vol. 16(8), pages 495-508, April.
    13. Richard H. Day, 1965. "Letter to the Editor—On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming," Operations Research, INFORMS, vol. 13(3), pages 482-494, June.
    14. John F. Pierce, 1968. "Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems," Management Science, INFORMS, vol. 15(3), pages 191-209, November.
    15. Jerrold Rubin, 1973. "A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling," Transportation Science, INFORMS, vol. 7(1), pages 34-48, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Knust, Sigrid & Schumacher, Elisabeth, 2011. "Shift scheduling for tank trucks," Omega, Elsevier, vol. 39(5), pages 513-521, October.
    2. Scott E. Sampson, 2008. "OR PRACTICE---Optimization of Vacation Timeshare Scheduling," Operations Research, INFORMS, vol. 56(5), pages 1079-1088, October.
    3. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    4. Oyku Ahipasaoglu & Nesim Erkip & Oya Ekin Karasan, 2019. "The venue management problem: setting staffing levels, shifts and shift schedules at concession stands," Journal of Scheduling, Springer, vol. 22(1), pages 69-83, February.

    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.
    1. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    2. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.
    3. James E. Stahl & Nan Kong & Steven M. Shechter & Andrew J. Schaefer & Mark S. Roberts, 2005. "A Methodological Framework for Optimally Reorganizing Liver Transplant Regions," Medical Decision Making, , vol. 25(1), pages 35-46, January.
    4. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
    5. Letchford, Adam N. & Salazar-González, Juan-José, 2019. "The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time," European Journal of Operational Research, Elsevier, vol. 272(1), pages 24-31.
    6. Swamy, Rahul & King, Douglas M. & Ludden, Ian G. & Dobbs, Kiera W. & Jacobson, Sheldon H., 2024. "A practical optimization framework for political redistricting: A case study in Arizona," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    7. F Caro & T Shirabe & M Guignard & A Weintraub, 2004. "School redistricting: embedding GIS tools with integer programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 836-849, August.
    8. Balázs Fleiner & Balázs Nagy & Attila Tasnádi, 2017. "Optimal partisan districting on planar geographies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 879-888, December.
    9. Edieal J. Pinker, 2013. "Introduction to the OR Forum Article: “Blotto Politics”," Operations Research, INFORMS, vol. 61(3), pages 531-531, June.
    10. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    11. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    12. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    13. R. Church & J. C. Duque & D. E. Restrepo, 2020. "The p-Innovation ecosystems model," Papers 2008.05885, arXiv.org.
    14. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    15. Djordje Dugošija & Aleksandar Savić & Zoran Maksimović, 2020. "A new integer linear programming formulation for the problem of political districting," Annals of Operations Research, Springer, vol. 288(1), pages 247-263, May.
    16. Benadè, Gerdus & Ho-Nguyen, Nam & Hooker, J.N., 2022. "Political districting without geography," Operations Research Perspectives, Elsevier, vol. 9(C).
    17. Christian Haas & Lee Hachadoorian & Steven O Kimbrough & Peter Miller & Frederic Murphy, 2020. "Seed-Fill-Shift-Repair: A redistricting heuristic for civic deliberation," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-34, September.
    18. Ting L. Lei & Richard L. Church, 2014. "Vector Assignment Ordered Median Problem," International Regional Science Review, , vol. 37(2), pages 194-224, April.
    19. Ashley E. Davis & Sanjay Mehrotra & John J. Friedewald & Mark S. Daskin & Anton I. Skaro & Michael M. Abecassis & Daniela P. Ladner, 2015. "Improving Geographic Equity in Kidney Transplantation Using Alternative Kidney Sharing and Optimization Modeling," Medical Decision Making, , vol. 35(6), pages 797-807, August.
    20. Muyldermans, L. & Cattrysse, D. & Van Oudheusden, D. & Lotan, T., 2002. "Districting for salt spreading operations," European Journal of Operational Research, Elsevier, vol. 139(3), pages 521-532, June.

    More about this item

    Statistics

    Access and download statistics

    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:128:y:2001:i:3:p:558-569. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.