Scheduling in reentrant robotic cells: algorithms and complexity (Q880491): 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.1007/s10951-005-5314-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062601646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parts and robot activities in a two machine robotic cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling of Identical Parts in a Robotic Cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic scheduling in robotic flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Scheduling in Robotic Cells: Classification, Two and Three Machine Cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in robotic cells: Complexity and steady state analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for flow-shop problems with transportation times and a single robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric critical path problem and an application for cyclic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling cycle shops: Classification, complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling large robotic cells without buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:07, 25 June 2024

scientific article
Language Label Description Also known as
English
Scheduling in reentrant robotic cells: algorithms and complexity
scientific article

    Statements

    Scheduling in reentrant robotic cells: algorithms and complexity (English)
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references