Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Scheduling Algorithms
Finding total unimodularity in optimization problems solved by linear programs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Scheduling multiprocessor UET tasks of two sizes
Theoretical Computer Science
Scheduling with a common due-window: Polynomially solvable cases
Information Sciences: an International Journal
Online scheduling of parallel jobs on hypercubes: maximizing the throughput
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We study the scheduling situation where n tasks, subjected to release dates and due dates, have to be scheduled on m parallel processors. We show that, when tasks have unit processing times and either require 1 or m processors simultaneously, the minimum maximal tardiness can be computed in polynomia time. Two algorithms are described. The first one is based on a linear programming formulation of the problem while the second one is a combinatorial algorithm. The complexity status of this "tall/small" task scheduling problem P|ri, pi = 1, sizei ∈ {1,m}|Tmax was unknown before, even for two processors.