Earliness/tardiness flow-shop scheduling under uncertainty

CORC > 沈阳自动化研究所 > 中国科学院沈阳自动化研究所 > 工业信息学研究室 > 先进制造技术研究室

	Earliness/tardiness flow-shop scheduling under uncertainty
	Li SF(李素粉); Zhu YL(朱云龙); Li, XY
	2005
会议名称	17th International Conference on Tools with Artificial Intelligence
会议日期	November 14-16, 2005
会议地点	Hong Kong, China
页码	499-506
中文摘要	For unconventional scheduling problems, both job sequence and starting time of every operation must be optimized, which increases the difficulties of solving this kind of problem. In this paper, we advanced a jointed algorithm for solving flow-shop earliness / tardiness problem based on genetic algorithm and heuristic algorithm. Hierarchy scheduling paradigm was introduced. First, the genetic algorithm is used to determine preferably scheduling sequence. Second, a kind of new heuristic algorithm was put forward to adjust the starting times for the present schedule. Where, the heuristic algorithm determined what time and how long every idle time should be. The object of this paper is to minimize the total earliness and tardiness penalties of all the jobs. The numerical results obtained prove the correctness and efficiencies of the jointed algorithm.
收录类别	EI ; CPCI（ISTP）
产权排序	1
会议主办者	IEEE Comp Soc, Informat Technol Res Inst, Wright State Univ, Hong Kong Univ Sci & Technol
会议录	ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS
会议录出版者	IEEE COMPUTER SOC
会议录出版地	LOS ALAMITOS
语种	英语
ISSN号	1082-3409
ISBN号	0-7695-2488-5
WOS记录号	WOS:000234632500079
内容类型	会议论文
源URL	[http://ir.sia.cn/handle/173321/8232]
专题	沈阳自动化研究所_工业信息学研究室_先进制造技术研究室
推荐引用方式 GB/T 7714	Li SF,Zhu YL,Li, XY. Earliness/tardiness flow-shop scheduling under uncertainty[C]. 见:17th International Conference on Tools with Artificial Intelligence. Hong Kong, China. November 14-16, 2005.