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

An extension of Johnson's results on job IDT scheduling

Author

Listed:
  • James R. Jackson

Abstract

No abstract is available for this item.

Suggested Citation

  • James R. Jackson, 1956. "An extension of Johnson's results on job IDT scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(3), pages 201-203, September.
    • Handle: RePEc:wly:navlog:v:3:y:1956:i:3:p:201-203
    DOI: 10.1002/nav.3800030307
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800030307
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800030307?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. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    2. Wieslaw Kubiak & Yanling Feng & Guo Li & Suresh P. Sethi & Chelliah Sriskandarajah, 2020. "Efficient algorithms for flexible job shop scheduling with parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 272-288, June.
    3. Christophe Sauvey & Wajdi Trabelsi & Nathalie Sauer, 2020. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems," Mathematics, MDPI, vol. 8(1), pages 1-17, January.
    4. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    5. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    6. Rhonda Righter, 1997. "A generalized Johnson's rule for stochastic assembly systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(2), pages 211-220, March.
    7. Evgeny Gafarov & Frank Werner, 2019. "Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine," Mathematics, MDPI, vol. 7(3), pages 1-11, March.
    8. Veera Babu Ramakurthi & Vijaya Kumar Manupati & Leonilde Varela & Goran Putnik, 2023. "Leveraging Blockchain to Support Collaborative Distributed Manufacturing Scheduling," Sustainability, MDPI, vol. 15(4), pages 1-23, February.
    9. S.S. Panwalkar & Christos Koulamas, 2015. "Scheduling research and the first decade of NRLQ: A historical perspective," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 335-344, June.
    10. Jonas Harbering & Abhiram Ranade & Marie Schmidt & Oliver Sinnen, 2019. "Complexity, bounds and dynamic programming algorithms for single track train scheduling," Annals of Operations Research, Springer, vol. 273(1), pages 479-500, February.
    11. S. Sevastyanov & D. Chemisova & I. Chernykh, 2014. "On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion," Annals of Operations Research, Springer, vol. 213(1), pages 253-270, February.

    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:3:y:1956:i:3:p:201-203. 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.