✦ LIBER ✦

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

✍ Scribed by V. T'kindt; F. Della Croce; C. Esswein

Book ID: 111594830
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 120 KB
Volume: 7
Category: Article
ISSN: 1094-6136
DOI: 10.1023/b:josh.0000046075.73409.7d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two branch-and-bound algorithms for the

Two branch-and-bound algorithms for the robust parallel machine scheduling problem

✍ Mohammad Ranjbar; Morteza Davari; Roel Leus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Enhancing CLP branch and bound technique

Enhancing CLP branch and bound techniques for scheduling problems

✍ F. Bosi; M. Milano 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

In this paper, we propose a constraint logic programming (CLP) approach to the solution of a job shop scheduling problem in the field of production planning in orthopaedic hospital departments. A pure CLP on finite domain (CLP(FD)) approach to the problem has been developed, leading to disappointing

Branch-and-bound strategies for fixed-ch

Branch-and-bound strategies for fixed-charge transportation problems

📂 Article 📅 1983 🏛 Elsevier Science ⚖ 125 KB

MPT-based branch-and-bound strategy for

MPT-based branch-and-bound strategy for scheduling problem in high-level synthesis

✍ Hsiao, P.-Y.; Wu, G.-M.; Su, J.Y. 📂 Article 📅 1998 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 657 KB

Branch and bound methods for a search pr

Branch and bound methods for a search problem

✍ Alan R. Washburn 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

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