IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v43y1996i1p143-149.html
   My bibliography  Save this article

Scheduling workers in a constricted area

Author

Listed:
  • J. Brimberg
  • W. J. Hurley
  • R. E. Wright

Abstract

A generalization of the equi‐partitioning problem, termed the 2D‐Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.

Suggested Citation

  • J. Brimberg & W. J. Hurley & R. E. Wright, 1996. "Scheduling workers in a constricted area," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(1), pages 143-149, February.
    • Handle: RePEc:wly:navres:v:43:y:1996:i:1:p:143-149
    DOI: 10.1002/(SICI)1520-6750(199602)43:13.0.CO;2-B
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199602)43:13.0.CO;2-B
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199602)43:13.0.CO;2-B?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. Tamara Borreguero Sanchidrián & Tom Portoleau & Christian Artigues & Alvaro García Sánchez & Miguel Ortega Mier & Pierre Lopez, 2024. "Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective," Annals of Operations Research, Springer, vol. 338(1), pages 13-40, July.

    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:wly:navres:v:43:y:1996:i:1:p:143-149. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.