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

A Branch-Bound Solution to the General Scheduling Problem

Author

Listed:
  • Harold H. Greenberg

    (General Electric Company, Denver, Colorado)

Abstract

A mixed integer formulation is presented for the general n job, m machine scheduling problem. This formulation is shown to reduce to a series of noninteger L.P. problems of moderate proportions when applying the branch-bound technique. Solutions are presented for the two problems: minimize make-span and minimize idle time. An example and some computational experience for the “minimize idle time” problem are given.

Suggested Citation

  • Harold H. Greenberg, 1968. "A Branch-Bound Solution to the General Scheduling Problem," Operations Research, INFORMS, vol. 16(2), pages 353-361, April.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:2:p:353-361
    DOI: 10.1287/opre.16.2.353
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.2.353
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.2.353?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. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    2. Pongcharoen, P. & Hicks, C. & Braiden, P. M. & Stewardson, D. J., 2002. "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, Elsevier, vol. 78(3), pages 311-322, August.
    3. Pongcharoen, P. & Hicks, C. & Braiden, P. M., 2004. "The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure," European Journal of Operational Research, Elsevier, vol. 152(1), pages 215-225, January.
    4. Yang, Lixing & Qi, Jianguo & Li, Shukai & Gao, Yuan, 2016. "Collaborative optimization for train scheduling and train stop planning on high-speed railways," Omega, Elsevier, vol. 64(C), pages 57-76.
    5. Zhou, Xuesong & Zhong, Ming, 2005. "Bicriteria train scheduling for high-speed passenger railroad planning applications," European Journal of Operational Research, Elsevier, vol. 167(3), pages 752-771, December.
    6. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    7. 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.
    8. Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
    9. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    10. Roslof, Janne & Harjunkoski, Iiro & Westerlund, Tapio & Isaksson, Johnny, 2002. "Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure," European Journal of Operational Research, Elsevier, vol. 138(1), pages 29-42, April.
    11. Michael Schachtebeck & Anita Schöbel, 2010. "To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions," Transportation Science, INFORMS, vol. 44(3), pages 307-321, August.

    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:16:y:1968:i:2:p:353-361. 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.