IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v62y2015i4p335-344.html
   My bibliography  Save this article

Scheduling research and the first decade of NRLQ: A historical perspective

Author

Listed:
  • S.S. Panwalkar
  • Christos Koulamas

Abstract

It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:62:y:2015:i:4:p:335-344
    DOI: 10.1002/nav.21631
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21631
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21631?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Harvey M. Wagner, 1959. "An integer linear‐programming model for machine scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 6(2), pages 131-140, June.
    3. Michael H. Rothkopf & Stephen A. Smith, 1984. "Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs," Operations Research, INFORMS, vol. 32(2), pages 451-456, April.
    4. J. Heller, 1960. "Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects," Operations Research, INFORMS, vol. 8(2), pages 178-184, April.
    5. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    6. James R. Jackson, 1957. "Simulation research on job shop production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 4(4), pages 287-295, December.
    7. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    8. Hamilton Emmons, 1975. "A note on a scheduling problem with dual criteria," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(3), pages 615-616, September.
    9. Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    10. Christos Koulamas, 1994. "The Total Tardiness Problem: Review and Extensions," Operations Research, INFORMS, vol. 42(6), pages 1025-1041, December.
    11. Melvin E. Salveson, 1997. "The Institute of Management Sciences: A Prehistory and Commentary on the Occasion of TIMS' 40th Anniversary," Interfaces, INFORMS, vol. 27(3), pages 74-85, June.
    12. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    13. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    14. 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.
    15. Roger L. Sisson, 1959. "Methods of Sequencing in Job Shops---A Review," Operations Research, INFORMS, vol. 7(1), pages 10-29, February.
    16. R. A. Dudek & S. S. Panwalkar & M. L. Smith, 1992. "The Lessons of Flowshop Scheduling Research," Operations Research, INFORMS, vol. 40(1), pages 7-13, February.
    17. Andrew Vazsonyi, 1955. "The Use of Mathematics in Production and Inventory Control--II (Theory of Scheduling)," Management Science, INFORMS, vol. 1(3-4), pages 207-223, 04-07.
    18. Jim Jackson, 2002. "How Networks of Queues Came About," Operations Research, INFORMS, vol. 50(1), pages 112-113, February.
    19. George B. Dantzig, 1956. "Recent Advances in Linear Programming," Management Science, INFORMS, vol. 2(2), pages 131-144, January.
    20. Bernard Giffler, 1968. "Schedule algebra: A progress report," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(2), pages 255-280, June.
    21. James R. Jackson, 1960. "Some problems in queueing with dynamic priorities," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 7(3), pages 235-249, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2000. "Sequencing jobs on a single machine: A neural network approach," European Journal of Operational Research, Elsevier, vol. 126(3), pages 474-490, November.
    2. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.
    3. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    5. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    6. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    7. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    8. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    9. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    10. Tian, Z. J. & Ng, C. T. & Cheng, T. C. E., 2005. "On the single machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 843-846, September.
    11. 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.
    12. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    13. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    14. F. Hwang & M. Kovalyov & B. Lin, 2014. "Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence," Annals of Operations Research, Springer, vol. 217(1), pages 263-279, June.
    15. Tanaka, Shunji & Araki, Mituhiko, 2008. "A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines," International Journal of Production Economics, Elsevier, vol. 113(1), pages 446-458, May.
    16. S H Yoon & I S Lee, 2011. "New constructive heuristics for the total weighted tardiness problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 232-237, January.
    17. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
    18. Baruch Mor & Gur Mosheiov, 2021. "Minmax due-date assignment on a two-machine flowshop," Annals of Operations Research, Springer, vol. 305(1), pages 191-209, October.
    19. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    20. A.A. Gladky & Y.M. Shafransky & V.A. Strusevich, 2004. "Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 13-28, 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:wly:navres:v:62:y:2015:i:4:p:335-344. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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)1520-6750 .

    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.