Minimising makespan for a two-machine, flow shop, single-wafer-processing, multiple-jobs-per-carrier scheduling problem

By Sarin Subhash C.  

International Journal of Planning and Scheduling, Vol. 1, Iss. 3, 2012-10 ,pp. : 171-208

Inderscience Publishers

Access to resources Recommend Favorite

Multi-objective flow shop scheduling using hybrid simulated annealing

By Dhingra Ashwani   Chandna Pankaj  

Measuring Business Excellence, Vol. 14, Iss. 3, 2010-01 ,pp. : 30-41

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Makespan distributions in flow shop scheduling

By Caffrey James   Hitchings Graham  

International Journal of Operations & Production Management, Vol. 15, Iss. 3, 1995-03 ,pp. : 50-58

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Simulated annealing-based algorithm for the capacitated hub routing problem

By Kumar P.N. Ram   Sivakumar Appa Iyer  

International Journal of Services and Operations Management, Vol. 14, Iss. 2, 2013-02 ,pp. : 221-235

Inderscience Publishers

Access to resources Recommend Favorite

A hybrid algorithm of simulated annealing and tabu search for graph colouring problem

By Pahlavani Ali   Eshghi Kourosh  

International Journal of Operational Research, Vol. 11, Iss. 2, 2011-06 ,pp. : 136-159

Inderscience Publishers

Access to resources Recommend Favorite