QQ客服 官方微博 反馈留言

	Dynamic scheduling algorithm for parallel machine scheduling problem
	Li Peng ; Liu Min ; Wu Cheng
	2010-05-06 ; 2010-05-06
关键词	Theoretical or Mathematical/ computational complexity dynamic scheduling manufacturing systems uncertain systems/ uncertain manufacturing environment computation complexity dynamic parallel machine scheduling algorithm operation-attributes-pattern/ C1290F Systems theory applications in industry C4240C Computational complexity E1010 Production management E1510 Manufacturing systems E1540 Systems theory applications
中文摘要	A dynamic parallel machine scheduling algorithm based on the pattern of operation attributes for scheduling problems with the constraint of fittings number (DSAC) was proposed for dynamic parallel machine scheduling problem in the uncertain manufacturing environment. The algorithm could readjust the starting time of operations and the sequence of adjacent operations according to the operation-attributes-pattern to optimize the total tardiness performance. Computational experiments under different scales of operations and equipments as well as different alternations of fittings number were carried out. Results showed that the algorithm was effective, and it had characteristics of low computation complexity, excellent real-time ability, and insensitiveness to the original scheduling method.
语种	中文 ; 中文
出版者	Editorial Department of CIMS ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9585]
专题	清华大学
推荐引用方式 GB/T 7714	Li Peng,Liu Min,Wu Cheng. Dynamic scheduling algorithm for parallel machine scheduling problem[J],2010, 2010.
APA	Li Peng,Liu Min,&Wu Cheng.(2010).Dynamic scheduling algorithm for parallel machine scheduling problem..
MLA	Li Peng,et al."Dynamic scheduling algorithm for parallel machine scheduling problem".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。