Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study

DOI10.1111/itor.13050MaRDI QIDQ6071074

Unnamed Author, Simon Thevenin, Nasser Mebarki

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsonline schedulingscheduling with rejectionpick-and-place

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multi-coloring for a job scheduling application
• Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
• Learning variable neighborhood search for a scheduling problem with time windows and rejections
• Two Job Cyclic Scheduling With Incompatibility Constraints
• A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximate algorithms for the container loading problem
• Approximate Dynamic Programming by Practical Examples
• Scheduling
• Integrated planning decisions in the broiler chicken supply chain
• Coordination mechanisms for scheduling games with machine modification

This page was built for publication: Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study