A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

Author： Ronconi Débora  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.138, Iss.1, 2005-09, pp. : 53-65

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

Analysis of antithetic sequences in flowshop scheduling to minimize makespan

By Moras R.   Smith M. L.   Kumar K. S.   Azim M. A.  

Production Planning and Control, Vol. 8, Iss. 8, 1997-12 ,pp. : 780-787

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila   Hadjiconstantinou Eleni   Christofides Nicos  

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

By Kuno Takahito  

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

By Aloise Daniel   Hansen Pierre  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 449-465

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

By Tomita Etsuji   Kameda Toshikatsu  

Journal of Global Optimization, Vol. 37, Iss. 1, 2007-01 ,pp. : 95-111

Springer Publishing Company

Access to resources Recommend Favorite