Approximation of a batch consolidation problem (Q3113503): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the \(k\)-batch consolidation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time constrained scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of planning and scheduling systems and methods for integrated steel production / rank
 
Normal rank

Latest revision as of 21:16, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation of a batch consolidation problem
scientific article

    Statements

    Approximation of a batch consolidation problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    batch production
    0 references
    minimization of batch number inapproximability
    0 references
    approximation algorithm
    0 references
    0 references