An optimization-based heuristic for the robotic cell problem
From MaRDI portal
Publication:1040983
DOI10.1016/j.ejor.2009.06.035zbMath1176.90199OpenAlexW2079590627MaRDI QIDQ1040983
Aziz Moukrim, Mohamed Haouari, Jacques Carlier, Mohamed Kharbeche
Publication date: 27 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.035
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times ⋮ A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ An optimization-based heuristic for the machine reassignment problem ⋮ Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times ⋮ Exact methods for the robotic cell problem ⋮ Incorporating human factors-related performance variation in optimizing a serial system ⋮ Unnamed Item ⋮ Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
Cites Work
- Unnamed Item
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Sequencing and scheduling in robotic cells: recent developments
- Scheduling of parts and robot activities in a two machine robotic cell
- Design and operational issues in AGV-served manufacturing systems
- Scheduling large robotic cells without buffers
- Scheduling no-wait robotic cells with two and three machines
- Cyclic scheduling in robotic flowshops
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- Job-shop scheduling with blocking and no-wait constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Throughput optimization in robotic cells
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Optimal planning of part's machining on a number of machines
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Integer Programming Formulation of Traveling Salesman Problems
- An improved genetic algorithm for the flowshop scheduling problem
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Minimizing Cycle Time in a Blocking Flowshop
- Lower bounding schemes for flowshops with blocking in-process
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Scheduling
- Part sequencing in three-machine no-wait robotic cells
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
