Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems (Q1357521)
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: Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems |
scientific article |
Statements
Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems (English)
0 references
10 June 1997
0 references
quasi-variational inequalities
0 references
Bellman equation
0 references
optimal scheduling
0 references
multi-item single machine
0 references
