Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Just-in-time scheduling with battery constraints

  • 期刊论文

  • 发表日期：

    2026年5月22日

查看全文
  • Byung-Cheon Choi,
  • Myoung-Ju Park,
  • Jibok Chung,
  • Kyung-Min Kim

摘要

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.