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

Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure

Author

Listed:
  • L. Gelders

    (Katholieke Universiteit Leuven, Louvain, Belgium)

  • P. R. Kleindorfer

    (International Institute of Management, Berlin, and the University of Pennsylvania, Philadelphia, Pennsylvania)

Abstract

A previous research report of the authors presented a formal model of the one-machine job-shop scheduling problem with variable labor capacity. This report presents some computational experience with the algorithm proposed previously and a discussion of the structural aspects of the problem. Extensions and refinements of the algorithm are introduced to deal with nonsimultaneous job arrivals and the production smoothing problem. These results provide insight into the structure of the aggregate-detailed cost trade-off problem and suggest a good heuristic decision rule for problems of realistic size and complexity.

Suggested Citation

  • L. Gelders & P. R. Kleindorfer, 1975. "Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure," Operations Research, INFORMS, vol. 23(2), pages 312-324, April.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:2:p:312-324
    DOI: 10.1287/opre.23.2.312
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.2.312
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.2.312?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. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    2. V. Jorge Leon & S. David Wu, 1992. "On scheduling with ready‐times, due‐dates and vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(1), pages 53-65, February.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.

    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:oropre:v:23:y:1975:i:2:p:312-324. 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.