IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v35y1987i3p378-388.html
   My bibliography  Save this article

Scheduling Tasks with Due Dates in a Fabrication/Assembly Process

Author

Listed:
  • Bruce Faaland

    (University of Washington, Seattle, Washington)

  • Tom Schmitt

    (University of Washington, Seattle, Washington)

Abstract

In fabrication and assembly processes, end-product due dates play a significant role in scheduling tasks to minimize earliness and lateness penalties. We develop a heuristic technique for this problem that solves a sequence of maximum flow problems to identify improved schedules. This method compares favorably with finite loading, another scheduling heuristic. Our computational results include the solution of a problem involving 26,100 tasks scheduled on 52 work centers.

Suggested Citation

  • Bruce Faaland & Tom Schmitt, 1987. "Scheduling Tasks with Due Dates in a Fabrication/Assembly Process," Operations Research, INFORMS, vol. 35(3), pages 378-388, June.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:3:p:378-388
    DOI: 10.1287/opre.35.3.378
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.3.378
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.3.378?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. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    2. J. Steve Davis & John J. Kanet, 1993. "Single‐machine scheduling with early and tardy completion costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 85-101, February.
    3. Mehdi Ghiyasvand, 2015. "Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs," Annals of Operations Research, Springer, vol. 229(1), pages 397-408, June.
    4. Thomas Schmitt & Bruce Faaland, 2004. "Scheduling recurrent construction," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1102-1128, December.

    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:oropre:v:35:y:1987:i:3:p:378-388. 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.