Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity

Abstract : This paper addresses a single machine scheduling problem in which the actual job processing times are determined by resource allocation function, its position in a sequence and a rate-modifying activity simultaneously. We discuss two objective functions with two resource allocation functions under the consideration of a rate-modifying activity. We show that the problems are solvable in O(n4) time for a linear resource allocation function and are solvable in O(n2logn) time for a convex resource allocation function.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00807717
Contributor : Frédéric Davesne <>
Submitted on : Thursday, April 4, 2013 - 11:06:46 AM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Links full text

Identifiers

Collections

Citation

Zhanguo Zhu, Feng Chu, Linyan Sun, Ming Liu. Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Applied Mathematical Modelling, Elsevier, 2013, 37 (7), pp.5371--5380. ⟨10.1016/j.apm.2012.09.072⟩. ⟨hal-00807717⟩

Share

Metrics

Record views

115