The Oven Scheduling Problem (OSP) is an NP-hard real-world parallel batch scheduling problem arising in the semiconductor industry. Its objective is to schedule a set of jobs on ovens while minimizing total oven runtime, job tardiness, and setup costs. At the same time, it must adhere to various constraints such as oven eligibility and availability, job release dates, setup times between batches, and oven capacity limitations. In this paper, we develop theoretical, problem-specific lower bounds for the OSP that can be computed very quickly. We thoroughly examine these lower bounds, evaluating their quality and capability to improve existing solution methods. Moreover, these problem-specific lower bounds enable us to assess the solution quality for large instances for which exact methods often fail to provide tight lower bounds.
Lackner, Marie-Louise, Ros, Francesca, Musliu, Nysret. Theoretical lower bounds for a parallel batch scheduling problem. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00887-y. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00887-y
Lackner, Marie-Louise, Ros, Francesca, Musliu, & Nysret (2026). Theoretical lower bounds for a parallel batch scheduling problem. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00887-y
Lackner, et al. “Theoretical lower bounds for a parallel batch scheduling problem.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00887-y.
@article{Lackner2026,
title = {Theoretical lower bounds for a parallel batch scheduling problem},
author = {Lackner and Marie-Louise and Ros and Francesca and Musliu and Nysret},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00887-y},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00887-y}
}
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...