Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study
From MaRDI portal
(Redirected from Publication:6071074)
Recommendations
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead
- A stochastic optimization approach for robot scheduling
- Optimization models for scheduling operations in robotic mobile fulfillment systems
- Resolution of a scheduling problem in a flowshop robotic cell
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
- Scheduling of dual-arm multi-tool assembly robots and workspace layout optimization
Cites work
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- Approximate algorithms for the container loading problem
- Approximate dynamic programming by practical examples
- Coordination mechanisms for scheduling games with machine modification
- Graph multi-coloring for a job scheduling application
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1947443 (Why is no real title available?)
- Integrated planning decisions in the broiler chicken supply chain
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling. Theory, algorithms, and systems
- Two job cyclic scheduling with incompatibility constraints
This page was built for publication: Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071074)
