Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

By T'kindt V.   Croce F. Della   Esswein C.  

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

Springer Publishing Company

Access to resources Recommend Favorite

Learning the set covering machine by bound minimization and margin-sparsity trade-off

By Laviolette François   Marchand Mario   Shah Mohak   Shanian Sara  

Machine Learning, Vol. 78, Iss. 1-2, 2010-01 ,pp. : 175-201

Springer Publishing Company

Access to resources Recommend Favorite

Can Machine Learning Offer Anything to Expert Systems?

By Buchanan B.G.  

Machine Learning, Vol. 4, Iss. 3-4, 1989-12 ,pp. : 251-254

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