Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081848918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for semiconductor burn-in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling an unbounded batch machine / rank
 
Normal rank

Latest revision as of 14:30, 11 June 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
scientific article

    Statements

    Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (English)
    0 references
    0 references
    0 references
    29 December 2005
    0 references
    0 references
    scheduling
    0 references
    batch processing
    0 references
    approximation scheme
    0 references
    0 references