Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation

ABSTRACT

This article addresses single machine resource allocation scheduling problems with learning effects, where learning effects mean job-dependent position-based learning effects. For the common due-date assignment (CON) and slack due-date assignment (SLK) methods, a bi-cost analysis of the scheduling cost and the total weighted resource consumption cost is provided. The objective is to determine the optimal job sequence and the resource allocation simultaneously, such that the scheduling cost (the total weighted resource consumption cost) is minimized subject to the total weighted resource consumption cost (the scheduling cost) being limited. Solution procedures are provided for the problems under consideration.

KEYWORDS:

• Scheduling
• resource allocation
• learning effect
• due-date assignment

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was supported by the Liaoning Province Universities and Colleges Basic Scientific Research Project of the Youth Project [Grant no. LQN2017ST04].