Computing closely matching upper and lower bounds on textile nesting problems

By Heckmann R.   Lengauer T.  

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 473-489

Elsevier

Access to resources Recommend Favorite

An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

By Hopper E.   Turton B.C.H.  

European Journal of Operational Research, Vol. 128, Iss. 1, 2001-01 ,pp. : 34-57

Elsevier

Access to resources Recommend Favorite

An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

By Zesheng H.   Taeyong Y.   Tiger A.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 99-117

Elsevier

Access to resources Recommend Favorite

Heuristic approaches for n/m/F/ C i scheduling problems

By Chengen W.   Chengbin C.   Proth J.-M.  

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 636-644

Elsevier

Access to resources Recommend Favorite

A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls

By Toth P.   Vigo D.  

European Journal of Operational Research, Vol. 113, Iss. 3, 1999-03 ,pp. : 528-543

Elsevier

Access to resources Recommend Favorite