Name
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 timepij. The objective is to find a schedule that minimizes the makespan. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/BF01585745 | FOCS |
Keywords | Field | DocType |
linear program,scheduling problem | Extreme point,Approximation algorithm,Discrete mathematics,Combinatorics,Algorithm design,Job shop scheduling,Polynomial,Integer programming,Schedule,Linear programming,Mathematics | Journal |
Volume | Issue | ISSN |
46 | 3 | 0025-5610 |
Citations | PageRank | References |
438 | 59.50 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. K. Lenstra | 1 | 1689 | 329.39 |
| David B. Shmoys | 2 | 4829 | 601.03 |
| Éva Tardos | 3 | 9299 | 963.85 |