Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007)
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 1930172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using short-term memory to minimize the weighted number of late jobs on a single machine. |
scientific article; zbMATH DE number 1930172 |
Statements
Using short-term memory to minimize the weighted number of late jobs on a single machine. (English)
0 references
18 June 2003
0 references
Scheduling
0 references
Weighted number of late jobs
0 references
Release times
0 references
Branch-and-bound
0 references
Dynamic programming
0 references
Lagrangean relaxation
0 references
Time-indexed formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8314206600189209
0 references
0.7995293736457825
0 references
0.7981034517288208
0 references
0.797314465045929
0 references
0.7946698665618896
0 references
