On the two-phase method for preemptive scheduling (Q1107434)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the two-phase method for preemptive scheduling |
scientific article; zbMATH DE number 4064758 |
Statements
On the two-phase method for preemptive scheduling (English)
0 references
1988
0 references
Preemptive scheduling problems on parallel processors may in some cases be solved by a two-phase method: first solve an LP problem which will give the minimum total completion time T and the processing times of the jobs on the various processors; second construct a feasible schedule using T time units. Some extensions of this procedure are discussed. A general model for preemptive scheduling is described with a two-phase method for solving problems of this type.
0 references
total unimodularity
0 references
flexible manufacturing systems
0 references
Preemptive scheduling
0 references
parallel processors
0 references
two-phase method
0 references
minimum total completion time
0 references
0.96778286
0 references
0.9106715
0 references
0.9017277
0 references
0.90014017
0 references
0.89979184
0 references
0 references
0 references
0.88624907
0 references
0.8851158
0 references
