HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE

スポンサーリンク

概要

• 論文の詳細を見る

• This paper considers a single-machine scheduling problem with a set of various jobs having different weights where the objective is to find the optimal assignment of a common due date and the associated optimal job sequencing to minimize the weighted mean absolute deviation (WMAD) of job completion times about the common due date. In the problem analysis, several dominant solution properties are characterized to organize two efficient heuristic solution algorithms, for which numerical experiments are then made for illustration and comparative review. Their preferences over the reference works are shown in efficiency and effectiveness senses.

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

著者

• Park C

  Korea Advanced Inst. Sci. And Technol. Taejon Kor

• Park C.

  Kores Advanced Institute Of Science And Technology

• Sumg C.S.

  Department of Industrial Engineering, Kores Advanced Institute of Science and Technology

• Min J.

  Kores Advanced Institute of Science and Technology

• Sumg C.s.

  Department Of Industrial Engineering Kores Advanced Institute Of Science And Technology

関連論文

• HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE

スポンサーリンク