|国家预印本平台
首页|基于额定加工时间的Job Shop排程问题研究

基于额定加工时间的Job Shop排程问题研究

Research on the job shop scheduling problem based on a given processing time

中文摘要英文摘要

针对深圳某企业车间中发现的一类限定加工时间的Job Shop型车间生产过程,以经典Job Shop排程模型为基础,设定最短加工时间、额定加工时间及低加工、低改善成本等多层次优化目标,建立起基于额定加工时间的Job Shop排程模型及一套优化改善方案,并以西安某公司的实例数据为基础,运用禁忌搜索算法和ILOG、Microsoft Visual Studio 2008两款软件对建立的排程模型进行实例仿真,取得了较好的效果,验证了模型及优化改善方案的可行性。

iming at a job shop production process with a limited processing time found in a factory in Shenzhen, this paper firstly establishes a new job shop scheduling model by setting a shortest processing time、a given processing time and a lower cost of working and improving as the optimization targets, which is based on theories of classical job shop scheduling model, and designs a set of optimzation methods for it. Then, based on actual data collected from a company in Xi'an, this paper makes a simulation on the proposed new model by employing the Tabu Search and two different kinds of software called ILOG and Microsoft Visual Studio 2008 respectively. The good results of simulation identify the feasibility of this new job shop scheduling model and the related optimzation methods .

李华、熊杰

自动化技术、自动化技术设备计算技术、计算机技术

Job Shop排程问题禁忌搜索算法ILOG

Job Shop Scheduling ProblemTabu SearchILOG

李华,熊杰.基于额定加工时间的Job Shop排程问题研究[EB/OL].(2011-08-05)[2025-08-03].http://www.paper.edu.cn/releasepaper/content/201108-102.点此复制

评论