Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects

Abstract

This study addresses convex resource allocation scheduling problems with exponential time-dependent learning effects. Under a single-machine, a bicriteria scheduling model is introduced where the first criterion is to minimize makespan, and the other is to minimize resource consumption cost. For some special cases, polynomial time algorithms are developed for three versions of considering the two costs. For the general case of the three versions of these two costs, we present a heuristic algorithm, a simulated annealing (SA), and a branch and bound algorithm to solve the problem.

Keywords:

• Scheduling
• branch and bound
• combinatorial optimization
• resource allocation
• learning effect
• simulated annealing

Disclosure statement

No potential conflict of interest was reported by the authors.

Data availability statement

The data used to support the findings of this article are available from the corresponding author upon request.

Additional information

Funding

This work was supported by the MOE Humanities and Social Sciences Planning Fund of China (21YJA860020).