A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4176813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility |
scientific article; zbMATH DE number 4176813 |
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
0.8834042
0 references
0.8787557
0 references
0.8715412
0 references
0.8702054
0 references
0.86577576
0 references
0.8617463
0 references
0.8588166
0 references
0.8580837
0 references
