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)
スポンサーリンク
概要
- 論文の詳細を見る
We construct two types of branch-and-bound algorithms to minimize total tardiness on identical parallel machines. The one is an improvement of the existing algorithm, and the other is based on the dynamic programming model for general parallel-machine scheduling problems. Computational experiments show that our algorithms can handle instances with up to 20 jobs while the existing algorithm can only handle instances with up to 12 jobs.
- 一般社団法人日本機械学会の論文
- 2004-05-24
著者
-
Tanaka Shunji
Graduate School Of Electrical Engineering Kyoto University
-
Araki Mituhiko
Graduate School of Electrical engineering, Kyoto University
-
Araki Mituhiko
Graduate School Of Electrical Engineering Kyoto University
関連論文
- 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