国際会議
[1]  Satoshi Fujita, Masayuki Masukawa, and Shigeaki Tagashira, ``A Fast Branch-And-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time,'' In The 2003 International Conference on Parallel Processing Workshops (ICPP 2003 Workshops) , pp. 104-111, October 2003. (Kaohsiung, Taiwan)
[2]  Satoshi Fujita, Masayuki Masukawa, and Shigeaki Tagashira, ``Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem,'' In Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, LNCS, vol. 2790, pp. 201-205, August 2003. (Klagenfurt, Austria)
[3]  Satoshi Fujita, Masayuki Masukawa, and Shigeaki Tagashira, ``A Fast Branch-And-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem,'' In Proc. the 9th International Conference on Parallel and Distributed Systems (ICPADS 2002) , pp. 611-616, December 2002. (Taiwan)
国内会議(査読付き)
[1]  藤田 聡, 益川正如, 田頭茂明, ``マルチプロセッサスケジューリング問題に対する分枝限定解法の下界の改良に基づく高速化について,'' 並列処理シンポジウム JSPP '02, May 2002. (エポカルつくば)
研究会・全国大会等
[1]  益川正如, 田頭茂明, 藤田 聡 , ``マルチプロセッサスケジューリング問題に対する分枝限定解法 HMSSのSTG ベンチマークセットを用いた実験的評価,'' 情報処理学会システム評価研究会, no. 2002-EVA-004, pp. 31-36, August 2002. (湯布院)
修士論文
[1]  Masayuki Masukawa, ``A Fast Branch-And-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with an Improved Lower Bounding Technique,'' Master thesis, 広島大学大学院工学研究科情報工学専攻, 2003.

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.