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.
Buchholz, Peter, Puzicha, Alexander. Schedules for pick-and-place robots. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00888-x. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00888-x
Buchholz, Peter, Puzicha, & Alexander (2026). Schedules for pick-and-place robots. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00888-x
Buchholz, et al. “Schedules for pick-and-place robots.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00888-x.
@article{Buchholz2026,
title = {Schedules for pick-and-place robots},
author = {Buchholz and Peter and Puzicha and Alexander},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00888-x},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00888-x}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...