Scheduling independent tasks to reduce mean finishing time

Authors:
J. Bruno;E. G. Coffman, Jr.;R. Sethi
Affiliations:
Pennsylvania State Univ., University Park;Pennsylvania State Univ., University Park;Pennsylvania State Univ., University Park
Venue:
Communications of the ACM
Year:
1974

Citing 1
Cited 84

The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Models of machines and computation for mapping in multicomputers

ACM Computing Surveys (CSUR)
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Scheduling unrelated machines with costs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Improved bicriteria existence theorems for scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
An Algorithm to Design the Memory Configuration of a Computer Network

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Approximation in stochastic scheduling: the power of LP-based priority policies

Journal of the ACM (JACM)
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Deterministic Processor Scheduling

ACM Computing Surveys (CSUR)
Lower bounds on precedence-constrained scheduling for parallel processors

Information Processing Letters
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Scheduling of tasks for distributed processors

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Scheduling independent processors with different storage capacities

ACM '74 Proceedings of the 1974 annual conference - Volume 1
On Test Scheduling for Core-Based SOCs

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science
Sensitivity Analysis for Scheduling Problems

Journal of Scheduling
A Note on System-on-Chip Test Scheduling Formulation

Journal of Electronic Testing: Theory and Applications
Heuristic methods for the identical parallel machine flowtime problem with set-up times

Computers and Operations Research
Complexity of preemptive minsum scheduling on unrelated parallel machines

Journal of Algorithms
A new average case analysis for completion time scheduling

Journal of the ACM (JACM)
Adaptive scheduling with parallelism feedback

Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Scheduling tasks with critical sections

ACM '77 Proceedings of the 1977 annual conference
Semi-matchings for bipartite graphs and load balancing

Journal of Algorithms
A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

Computers and Operations Research
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
Time-based fairness improves performance in multi-rate WLANs

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Scheduling for stability in single-machine production systems

Journal of Scheduling
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Computers and Operations Research
Exponential neighborhood search for a parallel machine scheduling problem

Computers and Operations Research
Optimal due date assignment in multi-machine scheduling environments

Journal of Scheduling
Distribution Stream of Tasks in Dual-Processor System

ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part II
Approximability of Average Completion Time Scheduling on Unrelated Machines

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Encouraging Cooperation in Sharing Supermodular Costs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Local Monotonicity in Probabilistic Networks

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Minimizing the normalized sum of square for workload deviations on m parallel processors

Computers and Industrial Engineering
Short Communication: Generating subproblems in branch and bound algorithms for parallel machines scheduling problem

Computers and Industrial Engineering
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
Hybrid solution algorithms for task scheduling problem with moving executors

Engineering Applications of Artificial Intelligence
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation
Complexity of preemptive minsum scheduling on unrelated parallel machines

Journal of Algorithms
Semi-matchings for bipartite graphs and load balancing

Journal of Algorithms
On batch scheduling of jobs with stochastic service times and cost structures on a single server

Journal of Computer and System Sciences
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
Sharing Supermodular Costs

Operations Research
Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints

Operations Research
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders

Discrete Applied Mathematics
Neuron network methods of task assignment in multiprocessing system

Optical Memory and Neural Networks
Faster algorithms for semi-matching problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Scheduling algorithms

Algorithms and theory of computation handbook
Analysis of multi-organization scheduling algorithms

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A new hybrid tractable class of soft constraint problems

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines

Journal of Intelligent Manufacturing
Inner product spaces for MinSum coordination mechanisms

Proceedings of the forty-third annual ACM symposium on Theory of computing
Hybrid tractability of valued constraint problems

Artificial Intelligence
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times

Computers & Mathematics with Applications
Proxy-Assisted scheduling for energy-efficient multimedia streaming over wireless LAN

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
On computing an optimal semi-matching

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A new dynamic programming algorithm for the parallel machines total weighted completion time problem

Operations Research Letters
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Operations Research Letters
The complexity of scheduling job families about a common due date

Operations Research Letters
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters
Worst-case analysis of a scheduling algorithm

Operations Research Letters
The complexity of machine scheduling for stability with a single disrupted job

Operations Research Letters
A note on weighted completion time minimization in a flexible flow shop

Operations Research Letters
Equivalence of mean flow time problems and mean absolute deviation problems

Operations Research Letters
A note on minimizing the sum of quadratic completion times on two identical parallel machines

Information Processing Letters
Reoptimization of the minimum total flow-time scheduling problem

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers and Operations Research
A family of heuristics for agent-based elastic Cloud bag-of-tasks concurrent scheduling

Future Generation Computer Systems
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units

Theoretical Computer Science
A comprehensive taxonomy for multi-robot task allocation

International Journal of Robotics Research
Altruism in Atomic Congestion Games

ACM Transactions on Economics and Computation
Scheduling problem with multi-purpose parallel machines

Discrete Applied Mathematics
A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines--part II: enhancements and experimentations

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	48.23

Visualization

Abstract

Sequencing to minimize mean finishing time (or mean time in system) is not only desirable to the user, but it also tends to minimize at each point in time the storage required to hold incomplete tasks. In this paper a deterministic model of independent tasks is introduced and new results are derived which extend and generalize the algorithms known for minimizing mean finishing time. In addition to presenting and analyzing new algorithms it is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, and hence unlikely to admit of a non-enumerative solution.