Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57185862, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cyclic scheduling in robotic flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal quantity of operators for serving a homogeneous linear technological process / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact optimal cyclic scheduling algorithm for multioperator service of a production line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the optimal starting times in a cyclic schedule with a given route / 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: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Schedules for Job Shops with Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Model for Periodic Scheduling Problems / rank
 
Normal rank

Latest revision as of 11:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
scientific article

    Statements

    Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    production-transportation process
    0 references
    cyclic scheduling
    0 references
    robotic scheduling
    0 references
    parametric PERT-CPM model
    0 references
    time windows
    0 references
    critical path
    0 references
    0 references
    0 references