A better algorithm for sequencing with release and delivery times on identical machines

Authors:
Nodari Vakhania
Affiliations:
Science Faculty, State University of Morelos, Av. Universidad 1001, Cuernavaca 62210, Morelos, Mexico and Institute of Computational Mathematics, Akuri 8, Tbilisi 93, Georgia
Venue:
Journal of Algorithms
Year:
2003

Citing 1
Cited 6

A fast algorithm for multiprocessor scheduling of unit-length jobs

SIAM Journal on Computing

Parallel batch scheduling of equal-length jobs with release and due dates

Journal of Scheduling
A polynomial-time algorithm for a special case of minimizing the lateness on a single machine

AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Parallel machine problems with equal processing times: a survey

Journal of Scheduling
Branch less, cut more and minimize the number of late equal-length jobs on identical machines

Theoretical Computer Science
A study of single-machine scheduling problem to maximize throughput

Journal of Scheduling
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of sequencing n equal-length jobs on m identical machines to minimize the maximal job completion time subject to release and delivery times is considered. An algorithm is proposed which improves the running time of previously known algorithms. The time complexity of the algorithm is O(qmaxmn log n + O(mκn)), where qmax is the maximal job delivery time and κ n is a parameter which is known only after the termination of the algorithm; in practice, κ turns out to be a small positive integer.