加工时间连续可控的双机床加工中心调度算法研究-控制理论与控制工程专业论文.docxVIP

西安理工大学硕士 西安理工大学硕士学位论文 ii ii 万方数据 万方 万方数据 Abstract Title: A RE5EARCH ON TWO-MACHINE JOB 5HOP 5CHEDU LlNG ALGORITHM WITH CONTINUOUSLY CONTROLLABLE PROCES51NG TIME Major: Control Theory and Control Engineering Name: 5ha LlU 5upervisor: Prof. Gang ZHENG Associate prof. Kailiang XU 5ignature:l./à. Li Iá 问nature: i?-- a似f Signature: 比以L、。也 Abstract A kind oftwo-machine job-shop scheduling problem with controllable job-processing time is studied in this paper，which shows a great improvement compared with the classical scheduling research where job-processing time is fixed and known in advance. By introducing the controllable job-processing time that can be compressed and controlled by allocating and consuming extra resource (such as fuel，electricity power ，gas，cash and labor)，this problem can ref1ect the real-world applications more accurately，and therefore is more suitable for scheduling problem study. Based on the introduction of controllable job-processing time，this paper focusses on how to optimally allocate resource to the jobs as well as how to optimally decide the processing sequence of the jobs ，such that all the jobs can be completed by the deadline，while the total consumption of the allocated resource can be minimized. In this paper，it is assumed that job-processing time is a continuous non-linear decreasing function of the allocated resource. Since both processing time and resource consumption are continuously controllable ，the two-machine job-shop scheduling problem becomes a nonlinear combined optimization problem with computational complexity ofNP hardness. A scheduling algorithm is studied and presented in this paper，which can provide satisfactory near-optimal result within acceptable computing time. The algorithm is composed oftwo sub -algorithms that work in cooperation: a resource allocation algorithm that optimally allocates resource to the jobs under the assumption that job-processing sequence is already determine