Symposium on the Theory of Scheduling and Its Applications
[Book]
edited by Salah E. Elmaghraby.
Berlin, Heidelberg
Springer Berlin Heidelberg
1973
Lecture Notes in Economics and Mathematical Systems, Operations Research, Computer Science, Social Science, 86.
I. Survey Papers --;"A Critique of Project Planning with Constrained Resources" --;"Sequencing Research and the Industrial Scheduling Problem" --;II. Applications --;"The Engine Scheduling Problem in a Railway Network" --;Abstract --;"Detail Scheduling Models and Systems" --;"A Naval Air Rework Facility Scheduling Problem" --;"Some Scheduling Applications in Chemical Industry" --;"A Solution to a Special Class of Flow Shop Scheduling Problem" --;"Two Recent Developments in Scheduling Applications" --;"Toward a Man-Machine Interactive System for Project Scheduling" --;III. Theory --;"Efficient Solution Procedures for Certain Scheduling and Sequencing Problems" --;"On the Set Representation and the Set Covering Problem" --;Discussion of Murty's paper --;"Selected Comments Concerning Optimization Techniques for Functions of Permutations" --;Discussion of Rau's paper --;IV. Models of Processes --;"An Out-of-Kilter Approach for Machine Sequencing Problems" --;"Trading Rules for a Decentralized Exchange Economy" --;"Scheduling with Early Start and Due Date Constraints" --;Abstract --;"The Scheduling of a Multi-Product Facility" --;"The Two-Machine Job Shop with Exponential Processing Times" --;"Optimal Solutions of Scheduling Problems Using Lagrange Multipliers, Part II" --;Discussion of Fisher's paper --;"On Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions" --;"A Problem in Single Facility Scheduling with Sequence Independent Change-Over Costs" --;"Random Patrol Scheduling Under Operational Constraints" --;"Interaction Between Aggregate and Detailed Scheduling in a Job Shop" --;Abstract --;"An Extension of Moore's Due Date Algorithm" --;"Solving Scheduling Problems by Applying Cost Operators to Assignment Models" --;"Some Extensions of Akers-Friedman Production Scheduling Problem" --;"On a Feasibility Approach to Optimal Schedules."
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.