TY - JOUR
T1 - Coupled task scheduling with convex resource consumption functions
AU - Mosheiov, Gur
AU - Oron, Daniel
AU - Salehipour, Amir
N1 - Publisher Copyright:
© 2021
PY - 2021/4/15
Y1 - 2021/4/15
N2 - We study a single machine scheduling problem with coupled tasks under limited resource availability. Each job comprises of two tasks which are separated by an exact amount of delay. We assume that the processing time of the initial task and the duration of the delay period are equal and the same for all jobs. The processing time of the completion task, however, is job-dependent and modelled as a convex function of the amount of resource the job is allocated. The scheduling objective consists of minimizing the makespan, subject to an upper-bound on the resource availability. We provide several properties of an optimal solution and develop an O(n2) time algorithm for the problem.
AB - We study a single machine scheduling problem with coupled tasks under limited resource availability. Each job comprises of two tasks which are separated by an exact amount of delay. We assume that the processing time of the initial task and the duration of the delay period are equal and the same for all jobs. The processing time of the completion task, however, is job-dependent and modelled as a convex function of the amount of resource the job is allocated. The scheduling objective consists of minimizing the makespan, subject to an upper-bound on the resource availability. We provide several properties of an optimal solution and develop an O(n2) time algorithm for the problem.
KW - Coupled tasks
KW - Makespan
KW - Resource consumption
KW - Scheduling
KW - Single machine
UR - http://www.scopus.com/inward/record.url?scp=85100664469&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2021.01.013
DO - 10.1016/j.dam.2021.01.013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85100664469
SN - 0166-218X
VL - 293
SP - 128
EP - 133
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -