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

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.83, Iss.1, 1998-01, pp. : 137-160

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A parallel branch-and-bound methodfor cluster analysis

By Iyer L.S. Aronson J.E.

Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. : 65-86

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy branch-and-bound algorithm for flow shop scheduling: Intelligent Manufacturing Systems: Vision for the Future (Guest Editors: Ercan Öztemel, Cemalettin Kubat and Harun Taşkin)

By Temİz İzzettİn Erol Serpİl

Journal of Intelligent Manufacturing, Vol. 15, Iss. 4, 2004-08 ,pp. : 449-454

Springer Publishing Company

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R. Posypkin M. Sigal I.

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Memory aware load balance strategy on a parallel branch‐and‐bound application

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 5, 2015-04 ,pp. : 1122-1144

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Multisections in Interval Branch-and-Bound Methods of Global Optimization

By Lagouanelle Jean-Louis Soubry Gérard

Journal of Global Optimization, Vol. 30, Iss. 1, 2004-09 ,pp. : 23-38

Springer Publishing Company

Access to resources Recommend Favorite