SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is not more than √<(10)/3>≈1.8257, regardless of the number of machines.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Park J

  Pohang University Of Science And Technology

• Park Jongho

  Pohang University Of Science And Technology

• Hwang Hark

  Chosun University

• Chang Soo

  Pohang University of Science and Technology

• Hwang Hark-Chin

  Chosun University

関連論文

• SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES

スポンサーリンク