Scheduling with a position-weighted learning effect and job release dates

Abstract

This article addresses how to minimize total completion time on a single machine with a position-weighted learning effect. Under non-zero job release dates, a lower bound on the objective function, a number of dominance properties, and an initial solution (i.e. an NEH-based heuristic) are derived, which are used to expedite the elimination process of a branch-and-bound solution procedure. The performance of the branch-and-bound algorithm and the heuristic algorithm are evaluated on a set of randomly generated problem instances.

Keywords:

• Scheduling
• learning effect
• branch and bound
• release dates
• single machine

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was partially supported by the National Natural Science Foundation of China [grant no. 71772033]; the Support Program for Innovative Talents in Liaoning University of China [grant no. LR2016017]; the Liaoning BaiQianWan Talents Program of China.