Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Approximation algorithms for scheduling unrelated parallel machines

Approximation algorithms for scheduling unrelated parallel machines We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep ij . The objective is to find a schedule that minimizes the makespan. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematical Programming Springer Journals

Approximation algorithms for scheduling unrelated parallel machines

Loading next page...
 
/lp/springer-journals/approximation-algorithms-for-scheduling-unrelated-parallel-machines-IseHYgKJcI

References (41)

Publisher
Springer Journals
Copyright
Copyright © 1990 by North-Holland
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Mathematics of Computing; Numerical Analysis; Combinatorics; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics
ISSN
0025-5610
eISSN
1436-4646
DOI
10.1007/BF01585745
Publisher site
See Article on Publisher Site

Abstract

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep ij . The objective is to find a schedule that minimizes the makespan.

Journal

Mathematical ProgrammingSpringer Journals

Published: Apr 14, 2005

There are no references for this article.