Improving the computation of lower bounds for optimal schedules

Authors:
T. Lang;E. B. Fernandez
Affiliations:
Computer Science Department, University of California, Los Angeles, California;IBM Data Processing Division Scientific Center, Los Angeles, California
Venue:
IBM Journal of Research and Development
Year:
1977

Citing 3
Cited 2

A comparison of list schedules for parallel processing systems

Communications of the ACM
Optimal Scheduling Strategies in a Multiprocessor System

IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

IEEE Transactions on Computers

A Computation Model of Parallel Solution of Linear Equations

IEEE Transactions on Computers
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Ways of decreasing the number of operations needed to compute the lower bounds of optimal schedules, by reducing the number of time intervals that must be considered, are presented. The bounds apply to a system of identical processors executing a partially ordered set of tasks, with known execution times, using a non-preemptive scheduling strategy. In one approach we find that the required number of intervals depends on the graph. In our other approach, which subsumes the first, the number of intervals is decreased to at most min[D2/2, n2], where D is the deadline to complete the tasks and n is the number of tasks. The actual number of intervals for a particular graph can be considerably smaller than this worst case.