A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation

This note revisits single machine due-date assignment scheduling with job-dependent learning effects and resource allocation. Under the convex decreasing resource consumption function, the problem is to minimize the scheduling cost subject to a constraint on the total weighted resource consumption c...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 53; no. 7; pp. 1273 - 1281
Main Authors Lu, Yuan-Yuan, Wang, Ting-Ting, Wang, Rui-Qi, Li, Yang
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.07.2021
Taylor & Francis Ltd
Subjects
Consumption
Learning
learning effect
Polynomials
Resource allocation
Scheduling
single machine
Online AccessGet full text

Cover

More Information
Summary:This note revisits single machine due-date assignment scheduling with job-dependent learning effects and resource allocation. Under the convex decreasing resource consumption function, the problem is to minimize the scheduling cost subject to a constraint on the total weighted resource consumption cost. Firstly, it is shown that the published results are incorrect by a counter-example from the literature. Then the corrected results are provided, and it is shown that this problem can be solved in polynomial time.
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2020.1773813