Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
DOI10.1016/j.ejor.2005.11.019zbMath1111.90033OpenAlexW2089989890WikidataQ57185862 ScholiaQ57185862MaRDI QIDQ856208
David Alcaide, Chengbin Chu, Gerard Sierksma, Eugene Levner, Vladimir Kats
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.019
time windowscritical pathcyclic schedulingrobotic schedulingparametric PERT-CPM modelproduction-transportation process
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Minimal quantity of operators for serving a homogeneous linear technological process
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
- A parametric critical path problem and an application for cyclic scheduling
- Determining the optimal starting times in a cyclic schedule with a given route
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
- Cyclic scheduling in robotic flowshops
- An exact optimal cyclic scheduling algorithm for multioperator service of a production line
- A Mathematical Model for Periodic Scheduling Problems
- Cyclic Schedules for Job Shops with Identical Jobs
- Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
This page was built for publication: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach