Opening book details…
Can I read Efficient Branch-and-bound Algorithm for Minimizing the Weighted Sum of Completion Times on a Single Machine with One Availability Constraint on EtoBox?
Efficient Branch-and-bound Algorithm for Minimizing the Weighted Sum of Completion Times on a Single Machine with One Availability Constraint by Imed Kacem; Chengbin Chu is a Business, Management and Accounting article available to read on EtoBox.
What is Efficient Branch-and-bound Algorithm for Minimizing the Weighted Sum of Completion Times on a Single Machine with One Availability Constraint about?
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.
Who reads Efficient Branch-and-bound Algorithm for Minimizing the Weighted Sum of Completion Times on a Single Machine with One Availability Constraint?
It is typically read by researchers, students, and practitioners in Business, Management and Accounting.
- Author
- Imed Kacem; Chengbin Chu
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0925-5273)
- Published
- 2008
- Language
- EN
- Field
- Business, Management and Accounting (Social Sciences)