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 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.38.1.70 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.38.1.70 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088377090 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.38.1.70 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:44, 20 December 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
