A space allocation algorithm for minimal makespan in space scheduling problems

Tunghai University Institutional Repository > 工學院 > 工業工程與經營資訊學系所 > 會議論文 > Item 310901/23193

請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/23193

題名:	A space allocation algorithm for minimal makespan in space scheduling problems
作者:	Perng, C.a, Lai, Y.-C.b , Ho, Z.-P.a, Ouyang, C.-L.a
貢獻者:	Department of Industrial Engineering and Enterprise Information, Tunghai University
關鍵詞:	Dispatching rules;Longest Contact Edge Algorithm;Resource constrained scheduling problem;Space Allocation Algorithm;Space scheduling problem
日期:	2009
上傳時間:	2013-06-11T09:03:22Z (UTC)
出版者:	Shanghai; China
摘要:	The factory space is one of the critical resources for the machine assembly industry. In machinery industry, space utilizations are critical to the efficiency of a schedule. The higher the utilization of a schedule is, the quicker the jobs can be done. Therefore, the main purpose of this research is to derive a method to allocate jobs into the shop floor to minimize the makespan for the machinery industry. In this research, we develop an algorithm, Longest Contact Edge Algorithm, to schedule jobs into the shop floor. We employed the algorithm to allocate space for jobs and found that the Longest Contact Edge Algorithm outperforms the Northwest Algorithm for obtaining better allocations. However, the Longest Contact Edge Algorithm results in more time complexity than that of the Northwest Algorithm. ? 2009 Springer-Verlag.
關聯:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 5855 LNAI, 2009, Pages 526-534
顯示於類別:	[工業工程與經營資訊學系所] 會議論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	126	檢視/開啟

在THUIR中所有的資料項目都受到原著作權保護.

資料載入中.....