带有可变加工时间和资源约束的排序问题-数学、运筹学与控制论专业论文.docxVIP

万方数据 万方数据 Scheduling problems with variable processing times and resource constraints Abstract In actual production process, if the job is processed, the actual processing time may not be a fixed constant. The actual processing time may be changed by the influence of the factors that are the efficiency of production, machine deteriorating, energy fuel consumption and resource constraints. In addition, in some models, the influence of some practical factors, for example: a job cost is too high or the processing time is too long, it will lead to additional costs, so we need to consider whether the job is processed. If the job is rejected, we will need to pay for an additional punishment. This paper considers the influence of the actual factors that include the learning effects, deteriorating factors, resource constraints, and the cost of refusing , considering the scheduling problems that the processing time is for linear and convex with resource allocation, etc. Specific content summarized as follows: 1）This paper considers unrelated parallel-machine scheduling problems with position dependent deteriorating jobs and resource allocation. In this paper, we focus on the two unrelated parallel machine problems that one objective function is the weighted sum of total load, total completion time, total absolute differences in completion time and total resource cost, and another function is the weighted sum of total load, total waiting time, total absolute differences in waiting times and total resource cost, respectively. The objectives are to find the optimal sequence of jobs and the optimal resource allocation, separately. We show that the problems can be transformed into corresponding assignment problems, then prove that the proposed problems can be solved in polynomial time under the proposed model. 2）This paper also considers unrelated parallel-machine scheduling problems with deteriorating jobs and convex resource allocation. The actual processing time of the