Optimal Due-Window Assignment Based on Common Flow Allowance under Linear Deteriorating and Resource-Dependent Processing Times

Abstract

This paper studies a due-window assignment problem on a single machine. The job-dependent due-windows are obtained by the common flow allowance criterion. We assume that the processing time of a job is a linear function of its starting time and decreasing function of the resource amount assigned to it. The objective is to find the optimal size and location of the due-windows, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, the earliness and tardiness of jobs and resource cost. We propose an algorithm to solve the problem.