Review of sequencing research
暂无分享,去创建一个
[1] Michael P. Hottenstein,et al. Expediting in Job-Order-Control Systems: A Simulation Study , 1970 .
[2] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[3] J. G. Madigan,et al. Scheduling a Multi-Product Single Machine System for an Infinite Planning Period , 1968 .
[4] Robert G. Brown. Simulations to explore alternative sequencing rules , 1968 .
[5] Allen H. Spinner. Sequencing theory – development to date† , 1968 .
[6] C. R. Glassey,et al. Minimum Change-Over Scheduling of Several Products on One Machine , 1968, Oper. Res..
[7] Salah E. Elmaghraby. The sequencing of “related” jobs , 1968 .
[8] E. Gerald Hurst,et al. Heuristic Scheduling in a Woolen Mill , 1967 .
[9] R. T. Nelson. Labor and Machine Limited Production Systems , 1967 .
[10] M. L. Wolfson,et al. An Algorithm for Solving Job Sequencing Problems , 1967 .
[11] Z. W. Kmietowicz,et al. Introduction to Operations Research. , 1968 .
[12] William L. Maxwell,et al. Theory of scheduling , 1967 .
[13] William S. Gere. Heuristics in Job Shop Scheduling , 1966 .
[14] Linus Schrage,et al. The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..
[15] Earl E. Bomberger,et al. A Dynamic Programming Approach to a Lot Size Scheduling Problem , 1966 .
[16] P. Mellor,et al. A Review of Job Shop Scheduling , 1966 .
[17] Z. A. Lomnicki,et al. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .
[18] R. Conway,et al. Sequencing Against Due-Dates , 1966 .
[19] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[20] J. William Gavett,et al. Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .
[21] B. P. Banerjee,et al. Single Facility Sequencing with Random Execution Times , 1965 .
[22] William Karush,et al. Letter to the Editor-A Counterexample to a Proposed Algorithm for Optimal Sequencing of Jobs , 1965 .
[23] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[24] Z. A. Lomnicki. A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem , 1965 .
[25] Henry D. Friedman,et al. Reduction Methods for Tandem Queuing Systems , 1965 .
[26] L. G. Mitten,et al. Sequencing Operations to Minimize In-Process Inventory Costs , 1965 .
[27] James G. Root. Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .
[28] Dennis W. Fife. Scheduling with Random Arrivals and Linear Loss Functions , 1965 .
[29] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .
[30] Eugene L. Lawler. On Scheduling Problems with Deferral Costs , 1964 .
[31] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .
[32] William L. Maxwell,et al. The scheduling of economic lot sizes , 1964 .
[33] M. Balinski,et al. On an Integer Program for a Delivery Problem , 1964 .
[34] H. M. Wagner,et al. Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .
[35] John M. Dutton,et al. PRODUCTION SCHEDULING—A BEHAVIORAL MODEL , 1964 .
[36] George L. Nemhauser,et al. A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .
[37] Earl LeGrande. The Development of a Factory Simulation System Using Actual Operating Data , 1963 .
[38] E. S. Buffa. Models for production and operations management , 1963 .
[39] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[40] William L. Maxwell,et al. Network Dispatching by the Shortest-Operation Discipline , 1962 .
[41] George Logemann,et al. An Algorithm for the Construction and Evaluation of Feasible Schedules , 1962 .
[42] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.
[43] J. Kingman. Two Similar Queues in Parallel , 1961 .
[44] P. Sandeman. EMPIRICAL DESIGN OF PRIORITY WAITING TIMES FOR JOBBING SHOP CONTROL , 1961 .
[45] G. L. Thompson. Recent developments in the job‐shop scheduling problem , 1960 .
[46] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[47] Coleridge A. Wilkins. On two queues in parallel , 1960 .
[48] C. T. Baker,et al. Simulation of a Simplified Job Shop , 1960 .
[49] Alan S. Manne,et al. On the Job-Shop Scheduling Problem , 1960 .
[50] Jack Heller,et al. Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .
[51] E. H. Bowman. THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .
[52] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .
[53] Harvey M. Wagner,et al. An integer linear‐programming model for machine scheduling , 1959 .
[54] Selmer Martin Johnson,et al. Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .
[55] L. G. Mitten. Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .
[56] Selmer M. Johnson,et al. On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .
[57] Roger L. Sisson,et al. Methods of Sequencing in Job Shops---A Review , 1959 .
[58] R. T. Nelson. Waiting-Time Distributions for Application to a Series of Service Centers , 1958 .
[59] Jack D. Rogers. A Computational Approach to the Economic Lot Scheduling Problem , 1958 .
[60] W. Karush,et al. Determination of Feasible Shipping Schedules for a Job Shop , 1958 .
[61] James R. Jackson,et al. Simulation research on job shop production , 1957 .
[62] E. Reich. Waiting Times When Queues are in Tandem , 1957 .
[63] James R. Jackson,et al. An extension of Johnson's results on job IDT scheduling , 1956 .
[64] S. Akers. Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .
[65] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[66] Joyce Friedman,et al. A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..
[67] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .