IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v21y1974i1p177-185.html
   My bibliography  Save this article

Some simple scheduling algorithms

Author

Listed:
  • W. A. Horn

Abstract

This paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty‐free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single‐machine case, and maximum lateness for a restricted multi‐machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine case.

Suggested Citation

  • W. A. Horn, 1974. "Some simple scheduling algorithms," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 177-185, March.
    • Handle: RePEc:wly:navlog:v:21:y:1974:i:1:p:177-185
    DOI: 10.1002/nav.3800210113
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800210113
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800210113?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. Christian L. Cesar & Peter G. Jessel, 1992. "Real‐time task scheduling with overheads considered," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 247-264, March.
    2. T.C.E. Cheng & Svetlana A. Kravchenko & Bertrand M.T. Lin, 2017. "Preemptive parallel‐machine scheduling with a common server to minimize makespan," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 388-398, August.
    3. Joseph Y.‐T. Leung & Michael Pinedo, 2004. "A note on scheduling parallel machines subject to breakdown and repair," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 60-71, February.
    4. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    5. Bruno Gaujal & Alain Girault & Stephan Plassart, 2020. "Dynamic speed scaling minimizing expected energy consumption for real-time tasks," Journal of Scheduling, Springer, vol. 23(5), pages 555-574, October.
    6. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    7. Nodari Vakhania, 2019. "Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates," Mathematics, MDPI, vol. 7(11), pages 1-42, November.
    8. Johnny C. Ho & Yih‐Long Chang, 1991. "Heuristics for minimizing mean tardiness for m parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 367-381, June.
    9. Rubing Chen & Jinjiang Yuan & C.T. Ng & T.C.E. Cheng, 2019. "Single‐machine scheduling with deadlines to minimize the total weighted late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 582-595, October.
    10. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2020. "Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost," Journal of Global Optimization, Springer, vol. 76(3), pages 471-490, March.
    11. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    12. 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.
    13. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.

    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:wly:navlog:v:21:y:1974:i:1:p:177-185. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.