Resource constrained scheduling on multiple machines

Authors:
Jan Remy
Affiliations:
Eidgenössische Technische Hochschule Zürich, Institut für Theoretische Informatik, Haldeneggsteig 4, IFW E49.1, CH-8092 Züürich, Switzerland
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 2

Scheduling parallelizable tasks to minimize average response time

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Smart SMART Bounds for Weighted Response Time Scheduling

SIAM Journal on Computing
Scheduling unrelated machines with costs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling parallel tasks to minimize average response time

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Expert Systems with Applications: An International Journal
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

Discrete Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper is devoted to RESOURCE CONSTRAINED SCHEDULING. An instance for this problem is given by a set of n jobs with lengths and weights and a set of m machines with capacities. At every time each machine can run arbitrary many jobs in parallel but the total weight of these jobs must not exceed the capacity of the machine. Furthermore the m machines work in parallel and we wish to find a schedule that minimizes the makespan or the sum of completion times. Thus load balancing on a cluster of servers is a typical application for scheduling under resource constraints. For both measures the problem is NP-complete even for m = 1. We show that the problem is approximable within factors of 2 (makespan) and 14.85 (sum of completion times) for arbitrary m.