Minimizing total tardiness in an unrelated parallel-machine scheduling problem |
| |
Authors: | S-O Shim Y-D Kim |
| |
Institution: | 1.Korea Advanced Institute of Science and Technology, Yusong-gu,Daejon,Korea |
| |
Abstract: | We consider a problem of scheduling n independent jobs on m unrelated parallel machines with the objective of minimizing total tardiness. Processing times of a job on different machines may be different on unrelated parallel-machine scheduling problems. We develop several dominance properties and lower bounds for the problem, and suggest a branch and bound algorithm using them. Results of computational experiments show that the suggested algorithm gives optimal solutions for problems with up to five machines and 20 jobs in a reasonable amount of CPU time. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|