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

Author： Duran Toksarı M.

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|1|211-219

ISSN： 0399-0559

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

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

Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning

By Duran Toksarı M. Oron Daniel Güner Ertan

RAIRO - Operations Research, Vol. 44, Iss. 2, 2010-04 ,pp. : 107-118

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

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

By Moukrim Aziz Rebaine Djamal Serairi Mehdi

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

Edp Sciences

Access to resources Recommend Favorite

Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect

By Zhu Zhanguo Chu Feng Yu Yugang Sun Linyan

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 733-748

Edp Sciences

Access to resources Recommend Favorite

Minimizing the Earliness and Tardiness Costof a Sequence of Tasks on a Single Machine

By Chrétienne Philippe

RAIRO - Operations Research, Vol. 35, Iss. 2, 2010-03 ,pp. : 165-187

Edp Sciences

Access to resources Recommend Favorite