An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy (Q337106)
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: An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy |
scientific article; zbMATH DE number 6650697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy |
scientific article; zbMATH DE number 6650697 |
Statements
An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy (English)
0 references
10 November 2016
0 references
lot sizing
0 references
scheduling
0 references
inventory
0 references
production
0 references
vehicle routing
0 references
ELSSP
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8986961841583252
0 references
0.8624352812767029
0 references
0.8476945161819458
0 references
0.8253527879714966
0 references
0.8253527879714966
0 references
