A computational study of smoothing heuristics for the traveling salesman problem

By Coy S.P.   Golden B.L.   Wasil E.A.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 15-27

Elsevier

Access to resources Recommend Favorite

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G.   Strusevich V.A.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite

Two simulated annealing-based heuristics for the job shop scheduling problem

By Steinhofel K.   Albrecht A.   Wong C.K.  

European Journal of Operational Research, Vol. 118, Iss. 3, 1999-11 ,pp. : 524-548

Elsevier

Access to resources Recommend Favorite

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

By Cheng J.   Steiner G.   Stephenson P.  

European Journal of Operational Research, Vol. 130, Iss. 3, 2001-05 ,pp. : 559-575

Elsevier

Access to resources Recommend Favorite

A hybrid genetic algorithm for the open shop scheduling problem

By Liaw C.-F.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 28-42

Elsevier

Access to resources Recommend Favorite