The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)00182-l / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015682010 / rank
 
Normal rank

Latest revision as of 09:59, 30 July 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references