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

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

By Baptiste P.   Peridy L.   Pinson E.  

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

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

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

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

By Rajendran C.   Ziegler H.  

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 129-138

Elsevier

Access to resources Recommend Favorite