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

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

[1]  Melvin E. Salveson,et al.  ON A QUANTITATIVE METHOD IN PRODUCTION PLANNING AND SCHEDULING , 1952 .

[2]  George B. Dantzig,et al.  RECENT ADVANCES IN LINEAR PROGRAMMING , 1956 .

[3]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[4]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[5]  Chris N. Potts,et al.  Fifty years of scheduling: a survey of milestones , 2009, J. Oper. Res. Soc..

[6]  W. L. Maxwell,et al.  THE SCHEDULING OF SINGLE MACHINE SYSTEMS: A REVIEW∗ , 1964 .

[7]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[8]  Fennell Burns,et al.  Technical Note - Johnson's Three-Machine Flow-Shop Conjecture , 1976, Oper. Res..

[9]  James R. Jackson,et al.  Simulation research on job shop production , 1957 .

[10]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[11]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[12]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[13]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[14]  G. L. Thompson.  Recent developments in the job‐shop scheduling problem , 1960 .

[15]  Bernard Giffler.  Schedule algebra: A progress report , 1968 .

[16]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[17]  R. Bellman,et al.  Some Combinatorial Problems Arising in the Theory of Multi-Stage Processes , 1954 .

[18]  Michael H. Rothkopf,et al.  Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs , 1984, Oper. Res..

[19]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[20]  Jim Jackson,et al.  How Networks of Queues Came About , 2002, Oper. Res..

[21]  B. Ciffler.  Scheduling general production systems using schedule algebra , 1963 .

[22]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[23]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[24]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[25]  James R. Jackson.  Some problems in queueing with dynamic priorities , 1960 .

[26]  Melvin E. Salveson.  The Institute of Management Sciences: A Prehistory and Commentary on the Occasion of TIMS' 40th Anniversary , 1997 .

[27]  Andrew Vazsonyi,et al.  The Use of Mathematics in Production and Inventory Control---II Theory of Scheduling , 1955 .

[28]  Roger L. Sisson,et al.  Methods of Sequencing in Job Shops---A Review , 1959 .

[29]  R. Bellman.  MATHEMATICAL ASPECTS OF SCHEDULING THEORY , 1956 .

[30]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[31]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[32]  Edward J. Wegman,et al.  A Conversation with Dorothy Gilford , 2007 .

[33]  S. S. Panwalkar,et al.  The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..

[34]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[35]  L. G. Mitten.  Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[36]  Hamilton Emmons,et al.  A note on a scheduling problem with dual criteria , 1975 .