A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines |
| |
| Institution: | 1. CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South 3169, Australia;2. Department of Mechanical and Manufacturing Engineering, University of Melbourne, 3010, Australia;1. Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China;2. Department of Statistics, Feng Chia University, Taichung 40724, Taiwan;3. Department of Computer Science and Information Management, Hungkuang University, Shalu 43302, Taiwan;1. Department of Industrial and Management Engineering, Dongseo University, San 69-1, Jurye-dong, Saanmg-gu, Busan 617-716, Republic of Korea;2. Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Songdo-dong, Yeonsu-gu, Incheon 406-772, Republic of Korea |
| |
| Abstract: | This paper investigates branch-and-bound algorithms for the problem of scheduling jobs with family setups on identical parallel machines to minimize the weighted sum of completion times. In particular, we propose a new branching scheme that appears to substantially outperform current procedures in terms of computation time and search tree size. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
