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

Authors:
Nodari Vakhania;Frank Werner
Affiliations:
Facultad de Ciencias, UAEMor, Mexico and Institute of Computational Mathematics, Georgia;Fakultät für Mathematik, Otto-von-Guericke-Universität, PSF 4120, 39106 Magdeburg, Germany
Venue:
Theoretical Computer Science
Year:
2013

Citing 5
Cited 0

Minimizing maximum promptness and maximum lateness on a single machine

Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A better algorithm for sequencing with release and delivery times on identical machines

Journal of Algorithms
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the problem of scheduling jobs with given release times and due dates on a single machine to minimize the maximum job lateness. It is NP-hard and remains such if the maximal job processing time is unrestricted and there is no constant bound on the difference between any job release times. We give a polynomial-time solution of the version in which the maximal job processing time and the differences between the job release times are bounded by a constant, which are restrictions that naturally arise in practice. Our algorithm reveals the inherent structure of the problem and also gives conditions when it is able to find an optimal solution unconditionally.