Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

Author： T'kindt V. Croce F. Della Esswein C.

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.7, Iss.6, 2004-11, pp. : 429-440

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

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

By Brucker Peter Kampmeyer Thomas

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 303-322

Springer Publishing Company

Access to resources Recommend Favorite

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

By Crauwels H. Potts C. Oudheusden D. Van Wassenhove L.

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 161-177

Springer Publishing Company

Access to resources Recommend Favorite

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

By Xu Kailiang

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 303-324

Springer Publishing Company

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

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

By Achuthan N.R. Hardjawidjaja A.

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 55-74

Springer Publishing Company

Access to resources Recommend Favorite