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

Author： Kacem Imed Souayah Nizar Haouari Mohamed

Publisher： Edp Sciences

E-ISSN： 1290-3868|46|2|125-147

ISSN： 0399-0559

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

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

A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times

By Duran Toksarı M.

RAIRO - Operations Research, Vol. 50, Iss. 1, 2016-02 ,pp. : 211-219

Edp Sciences

Access to resources Recommend Favorite

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

By Sun Zewen Gu Xingsheng

Sustainability, Vol. 9, Iss. 6, 2017-06 ,pp. : 953-953

MDPI

Access to resources Recommend Favorite

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

A branch-and-price-and-cut algorithm for the pattern minimization problem

By Alves Cláudio Valério de Carvalho J.M.

RAIRO - Operations Research, Vol. 42, Iss. 4, 2009-04 ,pp. : 435-453

Edp Sciences

Access to resources Recommend Favorite

Bicriteria scheduling for due date assignment with total weighted tardiness

By Lin Hao He Cheng Lin Yixun

RAIRO - Operations Research, Vol. 52, Iss. 2, 2018-05 ,pp. : 359-370

Edp Sciences

Access to resources Recommend Favorite