Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance

DOI10.1016/J.COR.2014.04.002zbMATH Open1348.90331OpenAlexW1991574367MaRDI QIDQ337088FDOQ337088

Ada Che, Pengyu Yan, Xiaoqiang Cai, Xiaowo 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

Recommendations

• Two-machine robotic cell scheduling problem with sequence-dependent setup times
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
• Scheduling in Robotic Cells: Heuristics and Cell Design
• Scheduling a two-machine robotic cell: A solvable case

zbMATH Keywords

branch and bound algorithmdynamic enumerationlimited disturbancerobotic cells reschedulingsearch strategy

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Artificial intelligence for robotics (68T40)

Cites Work

• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Cyclic Scheduling of Identical Parts in a Robotic Cell
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
• Sequencing and scheduling in robotic cells: recent developments
• One-machine rescheduling heuristics with efficiency and stability as criteria
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• On-line scheduling in a surface treatment system
• Cyclic hoist scheduling in large real-life electroplating lines
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Rescheduling for Job Unavailability
• Rescheduling for New Orders
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Two-machine robotic cell scheduling problem with sequence-dependent setup times
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• Scheduling in robotic cells: Complexity and steady state analysis
• Minimizing the number of robots to meet a given cyclic schedule
• 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
• Meta-heuristics for stable scheduling on a single machine
• An algorithm for hoist scheduling problems
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• 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

Cited In (11)

• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
• Scheduling in manufacturing with transportation: classification and solution techniques
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model
• An efficient bicriteria algorithm for stable robotic flow shop scheduling
• An optimization-based heuristic for the robotic cell problem
• A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• An efficient new heuristic for the hoist scheduling problem
• A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
• Multi-machine scheduling with interval constrained position-dependent processing times
• Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint

This page was built for publication: Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance

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