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

A parametric branch and bound approach to suboptimal explicit hybrid MPC

โœ Scribed by Axehill, Daniel; Besselmann, Thomas; Raimondo, Davide Martino; Morari, Manfred


Book ID
122511574
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
618 KB
Volume
50
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Branch and bound crossed with GA to solv
โœ M.-C. Portmann; A. Vignier; D. Dardilhac; D. Dezalay ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

This article deals with an optimal methods for solving a k-stage hybrid ยฏowshop scheduling problem. This problem is known to be NP-hard. In 1991, Brah and Hunsucker proposed a branch and bound algorithm to solve this problem. However, for some medium size problems, the computation time is not accept