The Scheduling Problem With Resource Constrained

Machine, as the only resource is needed in the traditional scheduling problems. And assume that the capabilities of the machines are infinite, so it can process jobs at any case. There are two sides to break through the hypothesis. One is that other resources are needed besides machines. The other is that the capabilities of the sources include-ing machines are not infinite, so the processing time of jobs may have relation to the resources. For instance, when numerical controlled machine tools are processing jobs, besides machine tools, other resources, such as electric power, manpower, raw and processed materials are needed. This kind of scheduling problems are called resource constrained scheduling problem. In this paper we discussed discretely resource scheduling problem and the one in which the processing time has relation to the resources. We give a polynomial algorithm for the first problem and an approximation algorithm for the second one.