A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

Author： Moukrim Aziz   Rebaine Djamal   Serairi Mehdi  

Publisher： Edp Sciences

E-ISSN： 1290-3868|48|2|235-254

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.48, Iss.2, 2014-03, pp. : 235-254

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

A memetic algorithm for the vehicle routing problem with time windows

By Labadi Nacima   Prins Christian   Reghioui Mohamed  

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 415-431

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

What kind of time for a Time Machine?

By  

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

Edp Sciences

Access to resources Recommend Favorite

A branch-and-price algorithm for the windy rural postman problem

By Afsar Hasan Murat   Jozefowiez Nicolas   Lopez Pierre  

RAIRO - Operations Research, Vol. 45, Iss. 4, 2012-03 ,pp. : 353-364

Edp Sciences

Access to resources Recommend Favorite