Coupled task scheduling with convex resource consumption functions

Mosheiov, G; Oron, D; Salehipour, A

Coupled task scheduling with convex resource consumption functions

Mosheiov, G Oron, D Salehipour, A

Permalink

Publisher:: ELSEVIER
Publication Type:: Journal Article
Citation:: Discrete Applied Mathematics, 2021, 293, pp. 128-133
Issue Date:: 2021-04-15

Closed Access

	Filename	Description	Size
	1-s2.0-S0166218X21000214-main.pdf	Published version	374.59 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mosheiov, G
dc.contributor.author	Oron, D
dc.contributor.author	Salehipour, A
dc.date.accessioned	2022-04-30T00:22:55Z
dc.date.available	2022-04-30T00:22:55Z
dc.date.issued	2021-04-15
dc.identifier.citation	Discrete Applied Mathematics, 2021, 293, pp. 128-133
dc.identifier.issn	0166-218X
dc.identifier.issn	1872-6771
dc.identifier.uri	http://hdl.handle.net/10453/156835
dc.description.abstract	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.
dc.language	English
dc.publisher	ELSEVIER
dc.relation	http://purl.org/au-research/grants/arc/DE170100234
dc.relation.ispartof	Discrete Applied Mathematics
dc.relation.isbasedon	10.1016/j.dam.2021.01.013
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0102 Applied Mathematics, 0802 Computation Theory and Mathematics
dc.subject.classification	Computation Theory & Mathematics
dc.title	Coupled task scheduling with convex resource consumption functions
dc.type	Journal Article
utslib.citation.volume	293
utslib.for	0102 Applied Mathematics
utslib.for	0802 Computation Theory and Mathematics
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
utslib.copyright.status	closed_access	*
dc.date.updated	2022-04-30T00:22:54Z
pubs.publication-status	Published
pubs.volume	293

Abstract:

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/156835