Abstract
Abstract
This paper concerns with a single-machine scheduling problem in which each job has a setup before being processed, the setup time and the processing time of jobs are controllable by allocating a continuously nonrenewable resource, respectively. This is different from that of [13], in which a job only has a processing time, but without a setup time. We assume that each setup and processing time of jobs has a workload that is both job and position-dependent. In the problem investigated, the total amount of resource for setup and processing times does not exceed an up bound, respectively. The objective is to determine the setup sequence, the job sequence and the resource allocation scheme to minimize makespan. We show that the problem can be solved in polynomial time and present an optimal algorithm.