2B2 AN IMPROVED ALGORITHM FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

スポンサーリンク

概要

• 論文の詳細を見る

• In this study we improve our previous exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. The previous algorithm successfully solved 89 out of 100 open benchmark instances with 60 jobs, but 11 instances were left open due to shortage of memory space although we did not restrict the computational time. To cope with it, we improve the algorithm to reduce memory usage and then it is applied to the 11 open instances. Numerical experiments will show that 9 instances are now optimally solved.

• 一般社団法人日本機械学会の論文
• 2009-07-04

著者

• Tanaka Shunji

  Graduate School Of Electrical Engineering Kyoto University

• Araki Mituhiko

  Matsue College Of Technology

関連論文

• 6A2 A BRANCH-AND-BOUND ALGORITHM BASED ON LARGRANGIAN RELAXATION FOR SINGLE-MACHINE SCHEDULING(Technical session 6A: Machine and shop scheduling 1)
• 2B2 TWO TYPES OF BRANCH-AND-BOUND ALGORITHMS FOR THE SCHEDULING PROBLEM TO MINIMIZE TOTAL TARDINESS ON IDENTICAL PARALLEL MACHINES(Technical session 2B : Combinatorics 1)
• 2B2 AN IMPROVED ALGORITHM FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

スポンサーリンク