On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4840775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs / rank | |||
Normal rank | |||
Revision as of 08:48, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs |
scientific article |
Statements
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (English)
0 references
15 January 1998
0 references
polyhedral combinatorics
0 references
single-item discrete lot-sizing
0 references
convex hull of feasible solutions
0 references
Wagner-Whitin costs
0 references
