A branch and bound to minimize the number of late jobs on a single machine with release time constraints

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.144, Iss.1, 2003-01, pp. : 1-11

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

Genetic algorithms to minimize the weighted number of late jobs on a single machine

By Sevaux M. Dauzere-Peres S.

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 296-306

Elsevier

Access to resources Recommend Favorite

Using short-term memory to minimize the weighted number of late jobs on a single machine

By Peridy L. Pinson E. Rivreau D.

European Journal of Operational Research, Vol. 148, Iss. 3, 2003-08 ,pp. : 591-603

Elsevier

Access to resources Recommend Favorite

Minimizing the weighted number of tardy jobs on a single machine

By M'Hallah R. Bulfin R.L.

European Journal of Operational Research, Vol. 145, Iss. 1, 2003-02 ,pp. : 45-56

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

On minimizing the weighted number of late jobs in unit execution time open-shops

By Baptiste P.

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 344-354

Elsevier

Access to resources Recommend Favorite