外文翻译 - 车间作业调度(JSSP)技术问题简明综述.docVIP

外文原文 Concise review job shop scheduling problem (JSSP) technology L introduction Production scheduling is the core content of CIMS research field production management and key technology, job shop scheduling problem (JSSP) is the most difficult constraint combinatorial optimization problem and a typical np-hard problem, its characteristic is not an effective algorithm to find out the optimal solution in polynomial time. Modern economy increasingly intensive competition trend and changing user requirements for producers to revaluate the manufacturing strategy, such as shorter production cycle and just-in-time inventory systems, such as the JSSP production environment is the most suitable for meet the needs of economic and existing users. Use of limited resources to satisfy the processing of various constraints, and determine the workpiece on the related equipment to process the order and time, to ensure the performance of the selected optimum, can potentially improve the economic benefits of enterprises, the JSSP has a number of practical application background, development, precise scheduling algorithm is an effective scheduling and optimization area important topic. The JSSP problems initially using optimization method, but calculation cant be very big, and practical. In recent years, based on biology, physics, artificial intelligence, neural networks, the rapid development of computer technology and simulation technology, has opened up a new train of thought for the research of scheduling problem. In this paper, according to the JSSP problem of a large number of literature, the classification of the theory and method of study on the system and introduces the recent developments in this field, discuss the direction of further research. 2 the general framework of JSSP problem 2.1 problem description JSSP problem can be described as: machine set in () add a workpiece set | in (), each artifact contains a process set composed of multi-channel process. Artifacts h