Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint

In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the effectiveness of the proposed method. The improved algorithm is able to solve instances of 6000 jobs in a reasonable amount of computation time.

MoreLess

Year of publication:	2008
Authors:	Kacem, Imed ; Chu, Chengbin
Published in:	International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 112.2008, 1, p. 138-150
Publisher:	Elsevier

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005311738