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
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
Journal of Scheduling
Parallel machine problems with equal processing times: a survey
Journal of Scheduling
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property
Mathematical and Computer Modelling: An International Journal
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Theoretical Computer Science
| Hi-index | 0.00 |
We study inherent structural properties of a strongly NP-hard problem of scheduling $$n$$ jobs with release times and due dates on a single machine to minimize the number of late jobs. Our study leads to two polynomial-time algorithms. The first algorithm with the time complexity $$O(n^3\log n)$$ solves the problem if during its execution no job with some special property occurs. The second algorithm solves the version of the problem when all jobs have the same length. The time complexity of the latter algorithm is $$O(n^2\log n)$$ , which is an improvement over the earlier known algorithm with the time complexity $$O(n^5)$$ .