Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect

Dexin Zou, Chong Jiang () and Weiwei Liu
Additional contact information
Dexin Zou: Nanjing Sport Institute
Chong Jiang: Nanjing Sport Institute
Weiwei Liu: Shenyang Sport University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 4, No 1, 868 pages

Abstract: Abstract In a recent paper (He et al. in J Comb Optim 33(2):626–644, 2017), the authors considered single machine resource allocation scheduling with general truncated job-dependent learning effect. For the convex resource consumption function and limited resource cost, the problem is to minimize the weighted sum of makespan, total completion time, the total absolute deviation in completion time and resource consumption cost. They conjectured that this problem is NP-hard. In this note we show that this problem can be solved in $$O(n^3)$$ O ( n 3 ) time. It is also shown that Lemma 4 in He et al. (2017) is incorrect by a counter-example.

Keywords: Scheduling; Learning effect; Resource allocation; Time complexity (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00628-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00628-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00628-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().