Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

DOI10.1016/J.EJOR.2005.11.019zbMATH Open1111.90033DBLPjournals/eor/AlcaideCKLS07OpenAlexW2089989890WikidataQ57185862 ScholiaQ57185862MaRDI QIDQ856208FDOQ856208

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

Recommendations

• Cyclic scheduling in a robotic production line
• Cyclic scheduling in robotic flowshops
• Minimizing the number of robots to meet a given cyclic schedule
• Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
• Cyclic Scheduling of Identical Parts in a Robotic Cell

zbMATH Keywords

time windowscyclic schedulingcritical pathrobotic schedulingparametric PERT-CPM modelproduction-transportation process

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06) Production models (90B30)

Cites Work

• A Mathematical Model for Periodic Scheduling Problems
• Title not available (Why is that?)
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• Cyclic scheduling in robotic flowshops
• Minimal quantity of operators for serving a homogeneous linear technological process
• An exact optimal cyclic scheduling algorithm for multioperator service of a production line
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• A parametric critical path problem and an application for cyclic scheduling
• Cyclic Schedules for Job Shops with Identical Jobs
• Determining the optimal starting times in a cyclic schedule with a given route
• Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects

Cited In (12)

• Optimal cyclic single crane scheduling for two parallel train oilcan repairing lines
• Cyclic scheduling in a robotic production line
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• A branch and bound algorithm for the cyclic job-shop problem with transportation
• Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
• Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
• A solution approach to find the critical path in a time-constrained activity network
• Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
• Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
• Time-optimal scheduling for high throughput screening processes using cyclic discrete event models
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows

Uses Software

• PESPLib

This page was built for publication: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856208)