Journal of Scheduling· 2026Q1
Schedules for pick-and-place robots
- 1citations
- Q1SCImago
- 2026year
Short summary
Integer linear programming (ILP) formulations, though computationally intensive, yield superior pick-and-place robot schedules compared to local search heuristics, achieving better solution quality and times.
AI-generated from the title and abstract; the full text is not read.
Key points
- Integer linear programming (ILP) formulations provide better quality and faster solutions for pick-and-place robot scheduling than local search heuristics.
- The complexity of the ILP model for a two-armed robot increases significantly to O(P^6) variables, compared to O(P^3) for a single-armed robot, where P is the number of parts.
- Decomposition-based approaches are effective for two-armed robots, breaking down the problem into multiple single-armed scheduling problems.
AI-generated from the title and abstract; the full text is not read.
Abstract
Abstract The efficiency of pick-and-place robots that put parts into boxes relies on efficient schedules, which determine the order in which parts are picked. The scheduling problem can be formulated as an integer linear program (ILP). However, the resulting ILP cannot be solved for realistic scenarios. Therefore, approximate solution techniques based on local search heuristics and simplified ILPs are introduced. It will be shown that ILP-based solutions outperform search heuristics in terms of solution times and solution quality. Additionally, we consider an extended version of the pick-and-place robot with two arms. It is shown that the resulting scheduling problem can be handled similarly to the problem for the robot with one arm, but the number of variables in the resulting ILP increases from $$O(P^3)$$ O ( P 3 ) for one arm to $$O(P^6)$$ O ( P 6 ) for two arms, where P is the number of parts to be picked. Consequently, decomposition-based approaches are introduced that reduce the scheduling problem for two arms to several problems with one arm.
The authors' abstract, as published at the source. Journal of Scheduling, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Industrial and Manufacturing Engineering
Industrial and Manufacturing EngineeringEngineering