A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:59, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility |
scientific article |
Statements
A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (English)
0 references
1990
0 references
fully polynomial approximation
0 references
single-product scheduling
0 references
finite capacity facility
0 references
lot sizing
0 references
timing of production lots
0 references
single facility
0 references
deterministic dynamic demands
0 references
finite continuous time planning horizon
0 references
