Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines∗

By Kacem Imed   Sahnoune Myriam   Schmidt Günter  

RAIRO - Operations Research, Vol. 51, Iss. 4, 2017-11 ,pp. : 1177-1188

Edp Sciences

Access to resources Recommend Favorite

Characterisation of parallel kinematic machines based on structural workspaces

By Corral Javier   Pinto Charles   Altuzarra Oscar   Zubizarreta Asier  

Mechanics & Industry, Vol. 14, Iss. 1, 2013-05 ,pp. : 43-51

Edp Sciences

Access to resources Recommend Favorite

Cosmic Time Machines: the Causality Issue

By  

EPJ Web of Conference, Vol. 58, Iss. issue, 2013-09 ,pp. : 01001-01001

Edp Sciences

Access to resources Recommend Favorite

Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods

By zitouni Rachid   selt Omar  

RAIRO - Operations Research, Vol. 50, Iss. 1, 2015-12 ,pp. : 83-90

Edp Sciences

Access to resources Recommend Favorite

Solving multi-agent scheduling problems on parallel machines with a global objective function

By Sadi F.   Soukhal A.   Billaut J.-C.  

RAIRO - Operations Research, Vol. 48, Iss. 2, 2014-03 ,pp. : 255-269

Edp Sciences

Access to resources Recommend Favorite