A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
From MaRDI portal
Publication:336565
DOI10.1016/J.COR.2013.01.024zbMath1348.90254OpenAlexW2004158688MaRDI QIDQ336565
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.2013.01.024
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ Static force capability optimization of humanoids robots based on modified self-adaptive differential evolution ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ New complexity results on scheduling problem in a robotic cell
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Sequencing and scheduling in robotic cells: recent developments
- An optimization-based heuristic for the robotic cell problem
- Scheduling no-wait robotic cells with two and three machines
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- Complexity of flow shop scheduling problems with transportation constraints
- Resolution of a scheduling problem in a flowshop robotic cell
- The hybrid flow shop scheduling problem
- Throughput optimization in robotic cells
- Robotic cells with parallel machines: throughput maximization in constant travel-time cells
- Convergence of an annealing algorithm
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS
- Equation of State Calculations by Fast Computing Machines
- Part sequencing in three-machine no-wait robotic cells
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots