Exact methods for the robotic cell problem

DOI10.1007/s10696-011-9079-2zbMath1230.90091OpenAlexW2069652239MaRDI QIDQ656059

Mohamed Kharbeche, Aziz Moukrim, Mohamed Haouari, Jacques Carlier

Publication date: 26 January 2012

Published in: Flexible Services and Manufacturing Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10696-011-9079-2

zbMATH Keywords

branch-and-boundgenetic algorithmslower boundsrobotic cellflow shop with transportation times and blocking

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times

Cites Work

• Unnamed Item
• Sequencing and scheduling in robotic cells: recent developments
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• An optimization-based heuristic for the robotic cell problem
• Scheduling of parts and robot activities in a two machine robotic cell
• A fast heuristic for the train scheduling problem
• Throughput optimization in robotic cells
• An improved genetic algorithm for the flowshop scheduling problem
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Exact methods for the robotic cell problem