The discrete lot-sizing and scheduling problem (Q582202): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lot-Sizing Algorithms for Complex Product Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning lot sizes and capacity requirements in a single stage production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Production Scheduling Model by Bivalent Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic Lot-Sizing Problem with Startup and Reservation Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank

Latest revision as of 11:12, 20 June 2024

scientific article
Language Label Description Also known as
English
The discrete lot-sizing and scheduling problem
scientific article

    Statements

    Identifiers

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