Dominance property based tabu search for single machine scheduling problems with family setups |
| |
| Authors: | Jin Feng Song Shiji Wu Cheng |
| |
| Affiliation: | Dept. of Automation, Tsinghua Univ., Beijing 100084, P. R. China |
| |
| Abstract: | The problem of minimizing the maximum lateness on a single machine with family setups is considered. To solve the problem, dominance property is studied and then introduced into the tabu search (TS) algorithm. With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space. The proposed algorithms are tested both on the randomly generated problems and on the real-life problems. Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average. |
| |
| Keywords: | single machine family setups tabu search dominance property |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息 |
|
点击此处可从《系统工程与电子技术(英文版)》下载全文 |
