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

A Method of Solution for General Machine-Scheduling Problems

Author

Listed:
  • John M. Charlton

    (University of Birmingham, Birmingham, England, and Imperial Chemical Industries Ltd., Mond Division, Cheshire, England)

  • Carl C. Death

    (University of Birmingham, Birmingham, England, and Dunlop Company Ltd., Birmingham, England)

Abstract

This paper proposes a general method of solution for problems, involving the allocation of jobs to machines and the sequencing of jobs on machines, in which a number of jobs, each consisting of a number of operations that may be performed on a given set of machines, is to be completed in some optimal fashion. Considering constraints on machine availability, job completion dates, and zoning, the paper demonstrates the underlying relation of a wide variety of machine-job problems with reference to their graphical representation, states a branch-and-bound method of solution, solves an illustrative example, and gives the mode of application to specific problems (for several of these the method reduces to methods published elsewhere). The algorithm represents not only a general framework of theoretical interest, but also a practical approach to certain specific problems.

Suggested Citation

  • John M. Charlton & Carl C. Death, 1970. "A Method of Solution for General Machine-Scheduling Problems," Operations Research, INFORMS, vol. 18(4), pages 689-707, August.
    • Handle: RePEc:inm:oropre:v:18:y:1970:i:4:p:689-707
    DOI: 10.1287/opre.18.4.689
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.18.4.689
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.18.4.689?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. 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.
    2. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.

    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:18:y:1970:i:4:p:689-707. 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.