期刊
RAIRO-OPERATIONS RESEARCH
卷 55, 期 2, 页码 561-569出版社
EDP SCIENCES S A
DOI: 10.1051/ro/2021030
关键词
Scheduling; unrelated parallel-machine; controllable processing times; learning effect
This study examines an unrelated parallel-machine scheduling problem with controllable processing times and job-dependent learning effects, aiming to minimize the weighted sum of total completion time, total load, and total compression cost. The authors demonstrate that the problem can be solved in O(n(m+2)) time, where m and n represent the numbers of machines and jobs. Additionally, they outline how this technique can be applied to various single-machine scheduling problems with total criteria.
This note studies a unrelated parallel-machine scheduling problem with controllable processing times and job-dependent learning effects, where the objective function is to minimize the weighted sum of total completion time, total load, and total compression cost. We show that the problem can be solved in O(n(m+2)) time, where m and n are the numbers of machines and jobs. We also show how to apply the technique to several single-machine scheduling problems with total criteria.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据