IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v22y1976i11p1204-1214.html
   My bibliography  Save this article

The Disaggregation of Aggregate Manpower Plans

Author

Listed:
  • Larry P. Ritzman

    (Ohio State University)

  • LeRoy J. Krajewski

    (Ohio State University)

  • Michael J. Showalter

    (Ohio State University)

Abstract

Aggregate manpower plans can be made operational only if they are translatable into shorter range assignments of personnel to specific work groups, operations, and products or services. This paper describes a combined heuristic programming and simulation algorithm amenable to this process of decomposition. Due to the complexity of the problem and the multiplicity of objectives, optimization techniques are only of academic interest. The algorithm is adapted to a particular environment, namely the construction of tour assignments in a post office. A "tour assignment" specifies simultaneously the exact timing (days and hours) of the work week (shift or tour) as well as the particular job assignment for each employee in the workforce. After describing the problem structure, the algorithm's logic is explained along with the interactive nature of the man-machine approach. Several options can be exercised to combine the power of a computer model with the judgment of the decision maker. The application of this methodology is illustrated with representative data, showing how the search and decision process can be conducted.

Suggested Citation

  • Larry P. Ritzman & LeRoy J. Krajewski & Michael J. Showalter, 1976. "The Disaggregation of Aggregate Manpower Plans," Management Science, INFORMS, vol. 22(11), pages 1204-1214, July.
    • Handle: RePEc:inm:ormnsc:v:22:y:1976:i:11:p:1204-1214
    DOI: 10.1287/mnsc.22.11.1204
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.22.11.1204
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.22.11.1204?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "Pre-processing techniques for resource allocation in the heterogeneous case," European Journal of Operational Research, Elsevier, vol. 107(2), pages 470-491, June.
    2. Restrepo, María I. & Gendron, Bernard & Rousseau, Louis-Martin, 2017. "A two-stage stochastic programming approach for multi-activity tour scheduling," European Journal of Operational Research, Elsevier, vol. 262(2), pages 620-635.
    3. Easton, F. F. & Rossin, D. F., 1997. "Overtime schedules for full-time service workers," Omega, Elsevier, vol. 25(3), pages 285-299, June.
    4. Scott E. Sampson, 2008. "OR PRACTICE---Optimization of Vacation Timeshare Scheduling," Operations Research, INFORMS, vol. 56(5), pages 1079-1088, October.
    5. Li, Ninghua & Li, Ling X., 2000. "Modeling staffing flexibility: A case of China," European Journal of Operational Research, Elsevier, vol. 124(2), pages 255-266, July.
    6. Vlado Popović & Milorad Kilibarda & Milan Andrejić & Borut Jereb & Dejan Dragan, 2021. "A New Sustainable Warehouse Management Approach for Workforce and Activities Scheduling," Sustainability, MDPI, vol. 13(4), pages 1-19, February.
    7. Jonathan F. Bard & Lin Wan, 2008. "Workforce Design with Movement Restrictions Between Workstation Groups," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 24-42, November.
    8. María I. Restrepo & Bernard Gendron & Louis-Martin Rousseau, 2016. "Branch-and-Price for Personalized Multiactivity Tour Scheduling," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 334-350, May.
    9. 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.
    10. Marie-Claude Côté & Bernard Gendron & Louis-Martin Rousseau, 2013. "Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 461-474, August.
    11. Marie-Claude Côté & Bernard Gendron & Louis-Martin Rousseau, 2011. "Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling," Management Science, INFORMS, vol. 57(1), pages 151-163, January.

    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:inm:ormnsc:v:22:y:1976:i:11:p:1204-1214. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.