An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. (Q1429932): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The Economic Lot Scheduling Problem (ELSP): Review and Extensions / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00024-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993854062 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. |
scientific article |
Statements
An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. (English)
0 references
27 May 2004
0 references
Global optimization
0 references
Inventory
0 references
