An optimal algorithm for the multi-item capacitated production planning problem (Q809873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noniterative multiproduct multiperiod production planning method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Scheduling by the Transportation Method of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Production Planning Over Time at Minimum Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90079-b / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024633912 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for the multi-item capacitated production planning problem
scientific article

    Statements

    An optimal algorithm for the multi-item capacitated production planning problem (English)
    0 references
    0 references
    0 references
    1991
    0 references
    lot-sizing
    0 references
    multi-item capacitated production planning
    0 references
    exact polynomial time algorithm
    0 references
    transportation algorithm
    0 references

    Identifiers