Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646)
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 91817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem |
scientific article; zbMATH DE number 91817 |
Statements
Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (English)
0 references
16 January 1993
0 references
one-machine scheduling
0 references
total tardiness minimization
0 references
sufficient condition for local optimality
0 references
dominant subset of schedules
0 references
approximate algorithms
0 references
0 references
0.8066462874412537
0 references
0.8032739162445068
0 references
0.7921556830406189
0 references
0.7892102599143982
0 references
