Stochastic scheduling of a batch processing machine with incompatible job families

By Duenyas I.   Neale J.J.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 191-220

Springer Publishing Company

Access to resources Recommend Favorite

Single machine scheduling with total tardiness criterion and convex controllable processing times

By Xu Kailiang   Feng Zuren   Ke Liangjun  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 383-391

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 to Minimize Total Weighted Tardiness on a Single Processor: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Babu Pascal  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 33-46

Springer Publishing Company

Access to resources Recommend Favorite

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time

By Crauwels H.A.J.   Hariri A.M.A.   Potts C.N.   van Wassenhove L.N.  

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 59-76

Springer Publishing Company

Access to resources Recommend Favorite