Single-Machine Scheduling with Resource-Dependent Learning Effect and Deteriorating Jobs

Abstract

This paper considers single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. The processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal sequence of jobs and optimal resource allocation so as to minimize the sum of earliness, tardiness, due-windows and resource and operation time cost, the considered problem is molded as an assignment problem and can be solved with a polynomial time algorithm.