Procedures for sequencing tasks with one resource type

SUMMARY This paper surveys the major developments in the area of sequencing with a single resource type. The survey considers both independent and dependent tasks in single and multiple resource problems in order to review existing work and to provide a context for future research. The study focuses on performance measures involving makespan, flowtime, and tardiness criteria and indicates the kinds of job information around which sequencing procedures have been successfully devised.

[1]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[2]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[3]  E. G. Coffman,et al.  Models of Pure time-sharing disciplines for resource allocation , 1969, ACM '69.

[4]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[5]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[6]  L. G. Mitten,et al.  Sequencing Operations to Minimize In-Process Inventory Costs , 1965 .

[7]  J. D. Wiest,et al.  Management Guide to PERT/CPM , 1969 .

[8]  Kenneth R. Baker,et al.  Scheduling with parallel processors and linear delay costs , 1973 .

[9]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[10]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

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

[12]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[13]  Glenn K. Manacher,et al.  Production and Stabilization of Real-Time Task Schedules , 1967, JACM.

[14]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[15]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[16]  James G. Root.  Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

[17]  Edward K. Bowdon.  Priority Assignment in a Network of Computers , 1969, IEEE Transactions on Computers.