摘要
由于已往的方法不适于求解日益复杂的Job Shop排序问题,介绍了FMS及其Job Shop问题,提出了基于JobShop问题的运筹学模型,即利用匈牙利算法解决Job Shop的最优排序问题,用M IP模型优化生产计划,以及其它运筹学方法在Job Shop问题中的应用。
As the sorting problem about Job Shop is becoming increasingly complex, the antecedent methods have not worked out. Under these conditions, OR models about Job Shop are proposed based on the analysis of FMS and Job Shop in this paper. In the models, the Job Shop optimization sorting problem is solved by using the Hungarian algorithm, the productive plan is optimized with the MIP model, and other operational research methods in Job Shop are introduced.
出处
《工业工程》
2007年第3期38-40,48,共4页
Industrial Engineering Journal
关键词
柔性制造系统
运筹学
车间问题
flexible manufacturing system
operational research（OR）
Job Shop problem
