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

Author： Kacem Imed Sahnoune Myriam Schmidt Günter

Publisher： Edp Sciences

E-ISSN： 1290-3868|51|4|1177-1188

ISSN： 0399-0559

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Capacitated two-stage time minimization transportation problem with restricted flow

By Kaur Prabhjot Verma Vanita Dahiya Kalpana

RAIRO - Operations Research, Vol. 51, Iss. 2, 2017-03 ,pp. : 447-467

Edp Sciences

Access to resources Recommend Favorite

Polynomial time algorithms for two classes of subgraph problem

By Sridharan Sriraman

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 291-298

Edp Sciences

Access to resources Recommend Favorite

The Communication Hierarchy of Time and SpaceBounded Parallel Machines

By Popély Norbert

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 2, 2010-03 ,pp. : 159-176

Edp Sciences

Access to resources Recommend Favorite

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

By Kacem Imed Souayah Nizar Haouari Mohamed

RAIRO - Operations Research, Vol. 46, Iss. 2, 2012-07 ,pp. : 125-147

Edp Sciences

Access to resources Recommend Favorite

Improved approximation of the general soft-capacitated facility location problem

By Alfandari Laurent

RAIRO - Operations Research, Vol. 41, Iss. 1, 2007-06 ,pp. : 83-93

Edp Sciences

Access to resources Recommend Favorite