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

A Branch-and-Bound Approach for a Two-Machine Flowshop Scheduling Problem

โœ Scribed by Amit Nagar, Sunderesh S. Heragu and Jorge Haddock

Book ID
125579869
Publisher
Palgrave Publishers Ltd.
Year
1995
Tongue
English
Weight
369 KB
Volume
46
Category
Article
ISSN
0160-5682

No coin nor oath required. For personal study only.

๐Ÿ“œ 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 ๐Ÿ“‚ 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