✦ LIBER ✦

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem : Wei-Chang Yeh, v20, n2, 2001, pp113–123

Publisher: Society of Manufacturing Engineers
Year: 2002
Tongue: English
Weight: 296 KB
Volume: 21
Category: Article
ISSN: 0278-6125
DOI: 10.1016/s0278-6125(02)80098-x

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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