✦ LIBER ✦

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

✍ Scribed by Mohammad Ranjbar; Morteza Davari; Roel Leus

Book ID: 113553771
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 377 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.09.019

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

Parallel branch-and-bound methods for th

Parallel branch-and-bound methods for thejob-shop scheduling problem

✍ Michael Perregaard; Jens Clausen 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 178 KB

A branch and bound algorithm for the two

A branch and bound algorithm for the two-stage assembly scheduling problem

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 654 KB

Tight bounds for the identical parallel

Tight bounds for the identical parallel machine scheduling problem

✍ Mohamed Haouari; Anis Gharbi; Mahdi Jemmali 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

A branch-and-bound parallel algorithm fo

A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem

✍ Mieczysław Wodecki 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB

A branch-and-bound algorithm for the sol

A branch-and-bound algorithm for the solution of two network scheduling problems

✍ A. I. Kuksa; B. E. Polyachenko 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 397 KB