MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the single machine sequencing problem in which each job has a processing time and a due date. The objective is to find a sequence of n jobs which minimizes the sum of the tardiness of each job. We present an O(n log n) MDD (Modified Due Date) rule which satisfies local optimality and show that the MDD rule has a worst-case performance ratio of n/2. The MDD rule is superior to other known O(n log n) heuristics in the sense of worst-case performance.

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

著者

• Kuo Yuh-kwo

  National Taiwan University

• Lai Tsung-Chyan

  Department of Industrial and Business Management, College of Management, National Taiwan University

• Lai Tsung-chyan

  Department Of Industrial And Business Management College Of Management National Taiwan University

関連論文

• MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING

スポンサーリンク