A Survey of the Inventory Control-Detailed Scheduling Problem.

Abstract : The paper surveys the inventory control problem in pure inventory systems and the detailed scheduling problem in the job shop and assembly line environments. Conditions under which inventory control systems may be substituted for production scheduling systems are briefly reviewed. The paper concludes with a discussion of the difficulties in integrating (production scheduling) inventory control systems with detailed scheduling systems. (Author)

[1]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[2]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[3]  Sant Arora,et al.  The Sequencing Problem , 1969 .

[4]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

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

[6]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[7]  Nick T. Thomopoulos,et al.  Line Balancing-Sequencing for Mixed-Model Assembly , 1967 .

[8]  John S. Fryer.  Operating Policies in Multiechelon Dual-Constraint Job Shops , 1973 .

[9]  Stephen J. Balut,et al.  Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain , 1973 .

[10]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

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

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

[13]  R. T. Nelson.  Labor and Machine Limited Production Systems , 1967 .

[14]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[15]  Earl LeGrande.  The Development of a Factory Simulation System Using Actual Operating Data , 1963 .

[16]  Morton Klein.  On Assembly Line Balancing , 1963 .

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

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

[19]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

[20]  M. Held,et al.  Assembly-Line Balancing---Dynamic Programming with Precedence Constraints , 1963 .

[21]  James R. Jackson,et al.  A Computing Procedure for a Line Balancing Problem , 1956 .

[22]  Walter C. Giffin.  Introduction to operations engineering , 1971 .

[23]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[24]  Donald C Carroll,et al.  Heuristic sequencing of single and multiple component jobs. , 1965 .

[25]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.