Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems (Q1357521): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1022682711077 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W175522741 / rank | |||
Normal rank | |||
Latest revision as of 10:45, 30 July 2024
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
0 references
