|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4693
|
| タイトル: | A Heuristic Algorithm for One-Machine Just-In-Time Scheduling Problem with Periodic Time Slots |
| 著者: | CHIBA, Eishi
HIRAISHI, Kunihiko |
| キーワード: | scheduling
just-in-time
set-up times
heuristic algorithm
minimum cost flow |
| 発行日: | 2005-05-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| 巻: | E88-A |
| 号: | 5 |
| 開始ページ: | 1192 |
| 終了ページ: | 1199 |
| DOI: | 10.1093/ietfec/e88-a.5.1192 |
| 抄録: | Just-in-time scheduling problem is the problem of finding an optimal schedule such that each job finishes exactly at its due date. We study the problem under a realistic assumption called periodic time slots. In this paper, we prove that this problem cannot be approximated, assuming P≠NP. Next, we present a heuristic algorithm, assuming that the number of machines is one. The key idea is a reduction of the problem to a network flow problem. The heuristic algorithm is fast because its main part consists of computation of the minimum cost flow that dominates the total time. Our algorithm is O(n3) in the worst case, where n is the number of jobs. Next, we show some simulation results. Finally, we show cases in which our algorithm returns an optimal schedule and is a factor 1.5 approximation algorithm, respectively, and also give an approximation ratio depending on the upper bound of set-up times. |
| Rights: | Copyright (C)2005 IEICE. E. Chiba, K. Hiraishi, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(5), 2005, 1192-1199. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/4693 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 6308.pdf | | 242Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
