QQ客服 官方微博 反馈留言

	Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems
	Min, L ; Cheng, W
	2010-05-06 ; 2010-05-06
关键词	parallel machine genetic algorithm heuristic fine-tuning operator simulated annealing scheduling textile SINGLE-MACHINE TARDINESS PENALTIES EARLINESS Computer Science, Interdisciplinary Applications Engineering, Manufacturing Robotics
中文摘要	Earliness/tardiness scheduling problems with undetermined common due date which have wide application background in textile industry, mechanical industry, electronic industry and so oil, are very important in the research fields Such as industry engineering and CIMS. In this paper, a kind of genetic algorithm based on sectional code for minimizing the total cost of assignment of due date, earliness and tardiness in this kind of scheduling problem is proposed to determine the optimal common due date and the optimal scheduling policy for determining the job number and their processing order on each machine. Also, Simulated annealing mechanism and the iterative heuristic fine-tuning operator are introduced into the genetic algorithm so as to construct three kinds of hybrid genetic algorithms with good performance. Numerical computational results focusing on the identical parallel machine scheduling problem and the general parallel machine scheduling problem shows that these algorithms Outperform heuristic procedures, and fit for larger scale parallel machine earliness/tardiness scheduling problem. Moreover, with practical application data from one of the largest cotton colored weaving enterprises in China, numerical computational results show that these genetic algorithms are effective and robust, and that especially the performance of the hybrid genetic algorithm based on simulated annealing and the iterative heuristic fine-tuning operator is the best among them. (c) 2005 Elsevier Ltd. All rights reserved.
语种	英语 ; 英语
出版者	PERGAMON-ELSEVIER SCIENCE LTD ; OXFORD ; THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/8931]
专题	清华大学
推荐引用方式 GB/T 7714	Min, L,Cheng, W. Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems[J],2010, 2010.
APA	Min, L,&Cheng, W.(2010).Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems..
MLA	Min, L,et al."Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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