The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The discrete lot-sizing and scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank | |||
Normal rank | |||
| 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: Some Extensions of the Discrete Lotsizing and Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3964308 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank | |||
Normal rank | |||
Revision as of 12:36, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming |
scientific article |
Statements
The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (English)
0 references
24 March 1994
0 references
lotsizing
0 references
single-item discrete lotsizing
0 references
0 references
