Symposium on the theory of scheduling and its applications, held on the campus of North Carolina State University at Raleigh, May 15-17, 1972

The theory of scheduling is receiving increased emphasis in research and practice for at least three good reasons. F~~t, the management of large scale projects resolves itself, in the final analysis, into problems of scheduling interacting activities subject to limited resources. Second, a great deal of "fat" that used to exist in the past in production, distribution, and service systems is eliminated, thanks to tighter managerial controls in information systems, in financial management, in logistics, and in many other facets of industrial enterprises and military installations. Tighter scheduling methods are therefore called for. Third, the study of scheduling problems involves the study of combina­ torial problems and optimization over discrete spaces which represent a radical, and interesting, departure from classical mathematics. This area of study has attracted a good number of distinguished researchers, engineers as well as mathematicians. There is a serious attempt to apply known number theory, and perhaps develop new theory, that would cope with the new problems. The computer enters the picture in novel and ingenious ways, which has not been possible before; etc. To those working in the area, whether in theory or in practice, progress proceeds at an exhilarating pace, with new mathematical structures and computational approaches being continuously introduced to model and solve the problems in novel, and oftentimes ingenious ways. Front Matter....Pages I-VIII A Critique of Project Planning with Constrained Resources....Pages 1-28 Sequencing Research and the Industrial Scheduling Problem....Pages 29-38 The Engine Scheduling Problem in a Railway Network Part I....Pages 39-43 Detail Scheduling Models and Systems....Pages 44-55 A Naval Air Rework Facility Scheduling Problem....Pages 56-68 Some Scheduling Applications in Chemical Industry....Pages 69-82 A Solution to a Special Class of Flow Shop Scheduling Problems....Pages 83-91 Two Recent Developments in Scheduling Applications....Pages 92-108 Toward a Man-Machine Interactive System for Project Scheduling....Pages 109-126 Efficient Solution Procedures for Certain Scheduling and Sequencing Problems....Pages 127-142 On The Set Representation and Set Covering Problems....Pages 143-163 Discussion of “On the Set Representation and the Set Covering Problem”....Pages 164-166 Selected Comments Concerning Optimization Techniques for Functions of Permutations....Pages 167-200 Discussion of “Selected Comments Concerning Optimization Theory for Functions of Permutations”....Pages 201-205 An Out-of-Kilter Approach for Machine Sequencing Problems....Pages 206-223 Trading Rules for a Decentralized Exchange Economy....Pages 224-241 Scheduling with Earliest Start and Due Date Constraints....Pages 242-243 The Scheduling of a Multi-Product Facility....Pages 244-277 The Two-Machine Job-Shop with Exponential Processing Times....Pages 278-293 Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II....Pages 294-318 Discussion of “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II”....Pages 319-323 On Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions....Pages 324-358 A Problem in Single Facility Scheduling with Sequence Independent Changeover Costs....Pages 359-380 Random Patrol Scheduling Under Operational Constraints....Pages 381-390 Interaction Between Aggregate and Detailled Scheduling in a Job Shop....Pages 391-392 An Extension of Moore’s Due Date Algotithm....Pages 393-398 Solving Scheduling Problems by Applying Cost Operators to Assignment Models....Pages 399-425 Some Extensions of Akers-Friedman Production Scheduling Problem....Pages 426-431 Research Abstract on a Feasibility Approach to Optimal Schedules....Pages 433-437 Back Matter....Pages 439-440 The theory of scheduling is receiving increased emphasis in research and practice for at least three good reasons. F~~t, the management of large scale projects resolves itself, in the final analysis, into problems of scheduling interacting activities subject to limited resources. Second, a great deal of "fat" that used to exist in the past in production, distribution, and service systems is eliminated, thanks to tighter managerial controls in information systems, in financial management, in logistics, and in many other facets of industrial enterprises and military installations. Tighter scheduling methods are therefore called for. Thi~d, the study of scheduling problems involves the study of combina­ torial problems and optimization over discrete spaces which represent a radical, and interesting, departure from classical mathematics. This area of study has attracted a good number of distinguished researchers, engineers as well as mathematicians. There is a serious attempt to apply known number theory, and perhaps develop new theory, that would cope with the new problems. The computer enters the picture in novel and ingenious ways, which has not been possible before; etc. To those workinQ in the area, whether in theory or in practice, progress proceeds at an exhilarating pace, with new mathematical structures and computational approaches being continuously introduced to model and solve the problems in novel, and oftentimes ingenious ways.