论文部分内容阅读
产品复杂的定制化生产制造过程中,往往包含有复杂交织装配的过程,因此,本文提出了一种包含产品装配过程的作业车间调度模型生产调度问题可以定义为若干Job在一些机器上进行加工,在一定的时间内如何协调机器、物力等资源的合理利用,使得某些目标函数达到最优。作业车间调度问题已经被证明属于计算复杂性很高的NP-hard问题,只有小规模的问题才能求得最优解。针对大规模的作业车间调度问题,求解算法一般有:优化方法与启发式方法、数学
Therefore, this paper presents a job shop scheduling model with product assembly process scheduling problem can be defined as a number of Job in a number of machines for processing, In a certain period of time, how to coordinate the rational utilization of resources such as machinery and material resources to make certain objective functions reach the optimum. Job shop scheduling problem has been proved to be NP-hard with high computational complexity. Only the small-scale problem can obtain the optimal solution. For large-scale job shop scheduling problems, the algorithm is generally solved: optimization methods and heuristic methods, mathematics