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

A branch and bound algorithm for the two-stage assembly scheduling problem

โœ Scribed by A.M.A. Hariri; C.N. Potts

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
654 KB
Volume
103
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
โœ Wei-Chang Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 826 KB

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-b

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