𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

✍ Scribed by Lee, G.-C.; Kim *, Y.-D.

Book ID
125828973
Publisher
Taylor and Francis Group
Year
2004
Tongue
English
Weight
215 KB
Volume
42
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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