IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v11y1964i2p268-279.html
   My bibliography  Save this article

Bounds for the Optimal Scheduling of n Jobs on m Processors

Author

Listed:
  • W. L. Eastman

    (Sperry Rand Research Center, Sudbury, Massachusetts)

  • S. Even

    (Sperry Rand Research Center, Sudbury, Massachusetts)

  • I. M. Isaacs

    (Sperry Rand Research Center, Sudbury, Massachusetts)

Abstract

The problem of scheduling n jobs on m identical processors has been introduced by R. McNaughton, but as yet no efficient algorithm has been found for determining an optimal sequencing of jobs. In this paper lower and upper bounds are given for the cost of an optimal schedule. Since the two bounds are not far apart, they may be helpful in practical scheduling problems. A procedure is described for obtaining a schedule which costs less than the given upper bound.

Suggested Citation

  • W. L. Eastman & S. Even & I. M. Isaacs, 1964. "Bounds for the Optimal Scheduling of n Jobs on m Processors," Management Science, INFORMS, vol. 11(2), pages 268-279, November.
    • Handle: RePEc:inm:ormnsc:v:11:y:1964:i:2:p:268-279
    DOI: 10.1287/mnsc.11.2.268
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.11.2.268
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.11.2.268?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. Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Decentralization and mechanism design for online machine scheduling," Research Memorandum 007, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Rabia Nessah & Chengbin Chu, 2010. "Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods," Annals of Operations Research, Springer, vol. 181(1), pages 359-375, December.
    3. Azizoglu, Meral & Kirca, Omer, 1999. "On the minimization of total weighted flow time with identical and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 113(1), pages 91-100, February.
    4. Webster, Scott, 1995. "Weighted flow time bounds for scheduling identical processors," European Journal of Operational Research, Elsevier, vol. 80(1), pages 103-111, January.
    5. Hui Liu & Maurice Queyranne & David Simchi‐Levi, 2005. "On the asymptotic optimality of algorithms for the flow shop problem with release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 232-242, April.
    6. Megow, Nicole & Schulz, Andreas S., 2004. "Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms," Working papers 4435-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Balireddi, Sindhura & Uhan, Nelson A., 2012. "Cost-sharing mechanisms for scheduling under general demand settings," European Journal of Operational Research, Elsevier, vol. 217(2), pages 270-277.
    8. Mehdi Rajabi Asadabadi, 2017. "A developed slope order index (SOI) for bottlenecks in projects and production lines," Computational Management Science, Springer, vol. 14(2), pages 281-291, April.
    9. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    10. Nicole Megow & Marc Uetz & Tjark Vredeveld, 2006. "Models and Algorithms for Stochastic Online Scheduling," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 513-525, August.
    11. José R. Correa & Martin Skutella & José Verschae, 2012. "The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 379-398, May.
    12. Itai Ashlagi & Shahar Dobzinski & Ron Lavi, 2012. "Optimal Lower Bounds for Anonymous Scheduling Mechanisms," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 244-258, May.
    13. José R. Correa & Andreas S. Schulz, 2005. "Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1005-1021, November.
    14. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    15. Birgit Heydenreich & Rudolf Müller & Marc Uetz, 2010. "Mechanism Design for Decentralized Online Machine Scheduling," Operations Research, INFORMS, vol. 58(2), pages 445-457, April.
    16. Andreas S. Schulz & Nelson A. Uhan, 2011. "Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 14-23, February.
    17. Lin Chen & Nicole Megow & Roman Rischke & Leen Stougie & José Verschae, 2021. "Optimal algorithms for scheduling under time-of-use tariffs," Annals of Operations Research, Springer, vol. 304(1), pages 85-107, September.
    18. Christoph Ambühl & Monaldo Mastrolilli & Nikolaus Mutsanas & Ola Svensson, 2011. "On the Approximability of Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 653-669, November.
    19. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.

    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:ormnsc:v:11:y:1964:i:2:p:268-279. 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.