Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (Q2434299): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complex Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for scheduling with limited intermediate storage / rank
 
Normal rank

Latest revision as of 07:32, 7 July 2024

scientific article
Language Label Description Also known as
English
Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
scientific article

    Statements

    Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (English)
    0 references
    0 references
    5 February 2014
    0 references
    scheduling
    0 references
    flowshop
    0 references
    buffer
    0 references
    multimedia applications
    0 references

    Identifiers