One-machine job-scheduling with non-constant capacity - Minimizing weighted completion times

Author： Amaddeo H.F.   Nawijn W.M.   van Harten A.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.102, Iss.3, 1997-11, pp. : 502-512

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 simulated annealing approach for the one-machine mean tardiness scheduling problem

By Ben-Daya M.   Al-Fawzan M.  

European Journal of Operational Research, Vol. 93, Iss. 1, 1996-08 ,pp. : 61-67

Elsevier

Access to resources Recommend Favorite

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

By Alidaee B.   Dragan I.  

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

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

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

Single machine scheduling with step-deteriorating processing times

By Cheng T.C.E.   Ding Q.  

European Journal of Operational Research, Vol. 134, Iss. 3, 2001-11 ,pp. : 623-630

Elsevier

Access to resources Recommend Favorite