Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
From MaRDI portal
Publication:337088
DOI10.1016/j.cor.2014.04.002zbMath1348.90331OpenAlexW1991574367MaRDI QIDQ337088
Ada Che, Pengyu Yan, Xiaoqiang Cai, Xiao-Wo Tang
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.04.002
branch and bound algorithmdynamic enumerationlimited disturbancerobotic cells reschedulingsearch strategy
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Artificial intelligence for robotics (68T40)
Related Items (9)
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Rescheduling on identical parallel machines with machine disruptions to minimize total completion time ⋮ An efficient new heuristic for the hoist scheduling problem ⋮ A dynamic scheduling approach for optimizing the material handling operations in a robotic cell ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ An efficient bicriteria algorithm for stable robotic flow shop scheduling ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
Cites Work
- Two-machine robotic cell scheduling problem with sequence-dependent setup times
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
- Sequencing and scheduling in robotic cells: recent developments
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Identical part production in cyclic robotic cells: Concepts, overview and open questions
- Parallel machine match-up scheduling with manufacturing cost considerations
- One-machine rescheduling heuristics with efficiency and stability as criteria
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Scheduling in robotic cells: Complexity and steady state analysis
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- Minimizing the number of robots to meet a given cyclic schedule
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
- An analysis of cyclic scheduling problems in robot centered cells
- Match-up scheduling under a machine breakdown
- Scheduling a two-machine robotic cell: A solvable case
- On-line scheduling in a surface treatment system
- Meta-heuristics for stable scheduling on a single machine
- Cyclic hoist scheduling in large real-life electroplating lines
- Rescheduling for Job Unavailability
- Rescheduling for New Orders
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- An algorithm for hoist scheduling problems
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
This page was built for publication: Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
