A branch-and-bound algorithm for the supply connected location-allocation problem on networks

By Yesilkokcen G.N.   Wesolowsky G.O.  

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 395-415

Elsevier

Access to resources Recommend Favorite

Scheduling in resource-constrained multiple projects to minimise the weighted tardiness and weighted earliness of projects

By Kanagasabapathi Balasubramanian   Rajendran Chandrasekharan   Ananthanarayanan Kuppuswamy  

International Journal of Operational Research, Vol. 7, Iss. 3, 2010-03 ,pp. : 334-386

Inderscience Publishers

Access to resources Recommend Favorite

Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment

By Solimanpur Maghsud   Sattari Hossein   Abazari Amir Musa  

International Journal of Operational Research, Vol. 13, Iss. 3, 2012-02 ,pp. : 281-294

Inderscience Publishers

Access to resources Recommend Favorite

The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

By Ng C.T.   Allahverdi Ali   Al-Anzi Fawaz S.   Cheng T.C. Edwin  

International Journal of Operational Research, Vol. 2, Iss. 2, 2007-02 ,pp. : 135-155

Inderscience Publishers

Access to resources Recommend Favorite

Minimising earliness and tardiness on parallel machines with sequence-dependent setups

By Magableh Ghazi M.   Mason Scott J.  

International Journal of Operational Research, Vol. 8, Iss. 1, 2010-05 ,pp. : 42-61

Inderscience Publishers

Access to resources Recommend Favorite