๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

โœ Scribed by Wei-Chang Yeh

Publisher
Society of Manufacturing Engineers
Year
2001
Tongue
English
Weight
826 KB
Volume
20
Category
Article
ISSN
0278-6125

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-bound algorithm is presented. The proposed algorithm and the existing ones are compared on randomly generated problems. The computational analysis on problems up to 20 jobs shows that the proposed branch-andbound algorithm is more efficient than the others, including the best-known algorithm. The upper bound used in the proposed branch-and-bound algorithm, a two-phase hybrid heuristic method, is also shown to be efficient. Its overall average error on the randomly generated problems is 0.000139, that is, almost equal to the optimal solution.

๐Ÿ“œ SIMILAR VOLUMES

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem : Wei-Chang Yeh, v20, n2, 2001, pp113โ€“123
๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 296 KB

and keyword index optimization, the infrastructure is capable of finding robust error recovery algorithms. It is expected that this approach will require less time for the generation of robust error recovery logic.

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
โœ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit