Research on scheduling with job-dependent learning effect and convex resource-dependent processing times

Abstract

We study resource allocation scheduling with job-dependent learning effect on a single machine with or without due date assignment considerations. For a convex resource processing time function, we provide a polynomial time algorithm to find the optimal job sequence, and resource allocations that minimise the schedule criterion (the total compression cost) subject to the constraint that the total compression cost (the schedule criterion) is less than or equal to a fixed amount.

Keywords:

• scheduling
• single machine
• due date assignment
• resource allocation
• job-dependent learning effect

Acknowledgements

The authors are grateful for the anonymous referees for their helpful comments on earlier version of the article.

Additional information

Funding

This research was supported by the National Natural Science Foundation of China [grant number 71471120] and [grant number 71271039]; the New Century Excellent Talents in University (NCET-13-0082), the Changjiang Scholars and Innovative Research Team in University (IRT1214), and the Fundamental Research Funds for the Central Universities (DUT14YQ211).