Permutation schedules for a two-machine flow shop with storage (Q1785731): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.12.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2216432406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / 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: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation vs. non-permutation flow shop schedules / rank
 
Normal rank

Latest revision as of 18:00, 16 July 2024

scientific article
Language Label Description Also known as
English
Permutation schedules for a two-machine flow shop with storage
scientific article

    Statements

    Permutation schedules for a two-machine flow shop with storage (English)
    0 references
    0 references
    0 references
    1 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    flow shop
    0 references
    buffer
    0 references
    permutation schedule
    0 references
    makespan
    0 references
    0 references