This paper introduces a new scheduling model with a battery constraint to minimize the total rejection cost for non-just-in-time jobs, equivalently, to maximize the weighted number of just-in-time jobs. The battery constraint stipulates that a job can be processed on a machine only if the battery is sufficiently charged. We first analyze how the computational complexity varies with respect to key parameters, including job weights, processing times, the battery-charging function, and the number of machines. Subsequently, we propose a mixed-integer linear programming formulation of the problem and develop two heuristic algorithms. The performance of the proposed methods is validated through extensive numerical experiments.
Choi, Byung-Cheon, Park, Myoung-Ju, Chung, Jibok et al. Just-in-time scheduling with battery constraints. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00876-1. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00876-1
Choi, Byung-Cheon, Park, Myoung-Ju, Chung, Jibok, Kim, & Kyung-Min (2026). Just-in-time scheduling with battery constraints. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00876-1
Choi, et al. “Just-in-time scheduling with battery constraints.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00876-1.
@article{Choi2026,
title = {Just-in-time scheduling with battery constraints},
author = {Choi and Byung-Cheon and Park and Myoung-Ju and Chung and Jibok and Kim and Kyung-Min},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00876-1},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00876-1}
}
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...