Scheduling on parallel identical machines to minimise the total weighted tardiness Online publication date: Thu, 18-Jun-2009
by Nizar Souayah, Imed Kacem, Mohamed Haouari, Chengbin Chu
International Journal of Advanced Operations Management (IJAOM), Vol. 1, No. 1, 2009
Abstract: This paper considers the problem of scheduling n independent jobs on m identical parallel machines to minimise the total weighted tardiness. We propose several lower bounds and upper bounds. These bounding procedures are used in a new branch-and-bound (BAB) algorithm. We also propose a branch-and-cut algorithm which we compare with the branch-and-bound algorithm. Computational experiments are performed on a large set of instances and the obtained results show the effectiveness of our method.
Online publication date: Thu, 18-Jun-2009
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org