Exact method for robotic cell problem

MaRDI QIDQ2861503zbMATH OpenFDO

Authors Mohamed Kharbeche, Jacques Carlier, Mohamed Haouari, A. Moukrim

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001101

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Exact methods for the robotic cell problem
• Two-machine robotic cell scheduling problem with sequence-dependent setup times
• Resolution of a scheduling problem in a flowshop robotic cell
• An efficient heuristic for robot acquisition and cell formation
• Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects

Cites work

• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An optimization-based heuristic for the robotic cell problem
• Scheduling
• Scheduling of parts and robot activities in a two machine robotic cell

Cited in

(7)

• Optimizing energy consumption of robotic cells by a branch \& bound algorithm
• Optimizing blocking flow shop scheduling problem with total completion time criterion
• A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
• A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
• On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
• Exact methods for the robotic cell problem
• A local strategy for cleaning expanding cellular domains by simple robots

This page was built for publication: Exact method for robotic cell problem

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