6A1 SCHEDULING IN A TWO-MACHINE FLOWSHOP FOR THE MINIMIZATION OF THE SUM OF ABSOLUTE DEVIATIONS FROM A COMMON DUE DATE(Technical session 6A: Machine and shop scheduling 1)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper addresses the minimization of the sum of absolute deviations (SAD) from a common due date in a two-machine flowshop scheduling problem. We present a heuristic that uses an algorithm, based on proposed properties, which obtain an optimal schedule for a given job sequence. Tests with a new set of benchmark problems are presented with the purpose of evaluating the heuristic. Computational experiments show that the developed heuristic outperforms results found in the literature for problems up to 500 jobs.

• 2006-07-18

著者

• Sakuraba Satoshi

  Department Of Production Engineering University Of Sao Paulo

• Ronconi Debora

  Department of Production Engineering University of Sao Paulo

関連論文

• 6A1 SCHEDULING IN A TWO-MACHINE FLOWSHOP FOR THE MINIMIZATION OF THE SUM OF ABSOLUTE DEVIATIONS FROM A COMMON DUE DATE(Technical session 6A: Machine and shop scheduling 1)

スポンサーリンク