Single-machine scheduling problems with release time of jobs depending on resource allocated

Abstract

Listen

Translate article

This paper considers the single-machine scheduling problems with learning effect and deteriorating jobs. Release time of jobs is a positive and strictly decreasing function about resource consumption. The optimal algorithm is presented for the problem to minimize the makespan with the total resource consumption constraints. Then, for a given sequence, we propose an optimal solution for the problem to minimize the total resource consumption with the makespan constraints.