The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem (Q3941152): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.28.7.798 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121917041 / rank | |||
Normal rank | |||
Latest revision as of 22:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem |
scientific article |
Statements
The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem (English)
0 references
1982
0 references
two-product, single-machine, static demand, infinite horizon lot scheduling
0 references
optimal solution algorithm
0 references
N-product schedules
0 references
necessary and sufficient feasibility conditions
0 references
