Scheduling problems on parallel dedicated machines with non-renewable resource
研究了并行专用机上考虑凸资源分配和有限非可再生资源的调度问题，针对完工时间、总负载和总加权完成时间三个基本指标，分别处理位置无关和位置相关的工作量情形。
Abstract We study scheduling problems on parallel dedicated machines and assume that a specific job can only be processed on one specific machine. We concentrate on solving scheduling problems involving convex resource allocation and address three of the most fundamental measures in scheduling theory, i.e., makespan, total load, and total weighted completion time. Firstly, we focus on position-independent workloads, and then we study the setting of general position-dependent workloads , i.e., the workloads are not restricted to be either monotone functions of the job positions or any specific functions. In all problems, we assume a common continuous and non-renewable (limited) resource and adapt known results from scheduling theory to solve the considered problems.