작업 지연과 통제 가능한 공정시간을 고려한 단일공정 스케줄링 문제

Abstract

We consider a single-machine scheduling problem such that the processing time of each job is inversely proportional to the power of the amount of resource consumption. The objective is to minimize the sum of the total resource consumption cost and the total late work, or minimize the total late work with a constraint on the total resource consumption cost. Under any objective, we prove the NP-hardness of the case with more than or equal to two different due dates, and the polynomiality of the case with a common due date.