A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times

ISSN： 0305-215X

Source： Engineering Optimization, Vol.41, Iss.6, 2009-06, pp. : 521-536

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

Minimizing mean squared deviation of completion times with maximum tardiness constraint

By Seo J.H. Kim C.-B. Lee D.H.

European Journal of Operational Research, Vol. 129, Iss. 1, 2001-02 ,pp. : 95-104

Elsevier

Access to resources Recommend Favorite

Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound

By Gutjahr W.J. Hellmayr A. Pflug G.C.

European Journal of Operational Research, Vol. 117, Iss. 2, 1999-09 ,pp. : 396-413

Elsevier

Access to resources Recommend Favorite

Scheduling with batch setup times and earliness-tardiness penalties

By Chen Z.-L.

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 518-537

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

By Hahn P. Grant T. Hall N.

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 629-640

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm for the mini-max spanning forest problem

By Yamada T. Takahashi H. Kataoka S.

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 93-103

Elsevier

Access to resources Recommend Favorite