期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 121, 期 -, 页码 189-194出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.05.035
关键词
Parallel-machine scheduling; Variable processing times; Learning effect; Maximum completion time; Total completion time
We introduce a new model of parallel-machine scheduling with job processing times described by proper Riemann integrals of a given function. We also formulate and prove a few properties of that model. Based on presented results, we show that some problems of parallel-machine scheduling of jobs with integral-based learning effect can be solved using polynomial algorithms applied earlier to fixed job processing times.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据