Jackson's rule for single-machine scheduling: making a good heuristic better
Mathematics of Operations Research
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
On the efficiency of polynomial time approximation schemes
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Note: A best on-line algorithm for single machine scheduling with small delivery times
Theoretical Computer Science
Jackson's semi-preemptive scheduling on a single machine
Computers and Operations Research
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
Mathematical and Computer Modelling: An International Journal
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job must be processed without interruption for a given amount of time on any one of the m machines. In addition, each job has a release date, when it becomes available for processing, and, after completing its processing, requires an additional delivery time. The objective is to minimize the time by which all jobs are delivered. In the notation of Graham et al. (1979), this problem is noted P|rj|Lmax. We develop a polynomial time approximation scheme whose running time depends only linearly on n. This linear complexity bound gives a substantial improvement of the best previously known polynomial bound (Hall and Shmoys, 1989). Finally, we discuss the special case of this problem in which there is a single machine and present an improved approximation scheme.