A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.cor.2008.01.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017441403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems under machine-dependent precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing to Minimize the Maximum Job Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two-machine flow-shop sequencing with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flow shop problem with arbitrary precedence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / 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: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine permutation flow shop scheduling problem with buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop problems with intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers / 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: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:02, 28 June 2024

scientific article
Language Label Description Also known as
English
A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
scientific article

    Statements

    A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2008
    0 references
    0 references
    multimedia presentation
    0 references
    object sequence optimization
    0 references
    buffer constraint
    0 references
    two-machine flowshop
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references