𝔖 Bobbio Scriptorium
✦   LIBER   ✦

RETRACTED ARTICLE: Two efficient algorithms for a quay crane scheduling and assignment problem

✍ Scribed by R. Tavakkoli-Moghaddam; F. Taheri; M. Bazzazi; S. Salahi

Book ID
106387913
Publisher
Springer US
Year
2010
Tongue
English
Weight
47 KB
Volume
21
Category
Article
ISSN
0956-5515

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