Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints (Q1096532)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints |
scientific article; zbMATH DE number 4031377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints |
scientific article; zbMATH DE number 4031377 |
Statements
Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints (English)
0 references
1987
0 references
A dynamic model and a scheduling algorithms are considered, which reduce the nonstationary scheduling problem with preemption constraints to a two-point boundary-value problem. A sample solution is given.
0 references
dynamic model
0 references
scheduling algorithms
0 references
preemption constraints
0 references
two-point boundary-value problem
0 references
0.88818413
0 references
0.8856984
0 references
0.88116914
0 references
0.8762946
0 references
0.8742797
0 references
0.8724296
0 references
0.87196875
0 references
0.87195444
0 references
0.8708888
0 references
