Robotic flow shop scheduling problem with combined buffer conditions
From MaRDI portal
Cites work
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- A global MILP model for FMS scheduling
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
- An optimization-based heuristic for the robotic cell problem
- Benchmarks for basic scheduling problems
- Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
- Complexity results for flow-shop problems with a single server
- Cyclic scheduling of parts and robot moves in m-machine robotic cells
- Deterministic constructive N-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
- Online algorithms for scheduling two parallel machines with a single server
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Optimization by simulated annealing
- Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda
- Predictive model-based multi-objective optimization with life-long meta-learning for designing unreliable production systems
- Quantifying the impact of layout on productivity: an analysis from robotic-cell manufacturing
- Resolution of a scheduling problem in a flowshop robotic cell
- Scheduling dual gripper robotic cell: one-unit cycles
- Scheduling for parallel dedicated machines with a single server
- Scheduling in manufacturing with transportation: classification and solution techniques
- Scheduling production tasks in a two-stage FMS
- Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
- Single-server parallel-machine scheduling with loading and unloading times
- Solving the two-machine open shop problem with a single server with respect to the makespan
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models
- Two-machine flow shop problems with a single server
- Two-machine robotic cell scheduling problem with sequence-dependent setup times
This page was built for publication: Robotic flow shop scheduling problem with combined buffer conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255503)
