Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling (Q4887785)
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: Publication:4887785 |
scientific article; zbMATH DE number 913389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling |
scientific article; zbMATH DE number 913389 |
Statements
Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling (English)
0 references
5 August 1996
0 references
lot-sizing
0 references
scheduling
0 references
proportional multi-item, capacitated, dynamic lot-sizing and scheduling problem
0 references
greedy randomized algorithm
0 references
regret-based biased sampling
0 references
0.8266739845275879
0 references
0.8144582509994507
0 references
0.8144582509994507
0 references
0.7851085662841797
0 references
0.7826663255691528
0 references
