A fast algorithm for multiprocessor scheduling of unit-length jobs
SIAM Journal on Computing
Preemptive scheduling to minimize mean weighted flow time
Information Processing Letters
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
On the complexity of minimizing the number of late jobs in unit time open shop
Discrete Applied Mathematics
Scheduling equal-length jobs on identical parallel machines
Discrete Applied Mathematics
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
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling
Finding total unimodularity in optimization problems solved by linear programs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Bicriterion scheduling with equal processing times on a batch processing machine
Computers and Operations Research
A fast algorithm for single processor scheduling
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Online scheduling of equal-processing-time task systems
Theoretical Computer Science
Note: On a parallel machine scheduling problem with equal processing times
Discrete Applied Mathematics
Preemptive scheduling on uniform machines to minimize mean flow time
Computers and Operations Research
Scheduling unit length jobs with parallel nested machine processing set restrictions
Computers and Operations Research
NP-complete scheduling problems
Journal of Computer and System Sciences
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Operations Research Letters
A study of single-machine scheduling problem to maximize throughput
Journal of Scheduling
Theoretical Computer Science
| Hi-index | 0.00 |
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered.