𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime

✍ Scribed by Wei-Chang Yeh; Ali Allahverdi

Book ID
111205750
Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
168 KB
Volume
11
Category
Article
ISSN
0969-6016

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

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 for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
✍ Theodore G. Voutsinas; Costas P. Pappis πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the