Minimizing tardy jobs in a flowshop with common due date

By Della Croce F.   Gupta J.N.D.   Tadei R.  

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 375-381

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

Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

By Gowrishankar K.   Rajendran C.   Srinivasan G.  

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 643-665

Elsevier

Access to resources Recommend Favorite

Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

By Lin B.M.T.   Cheng T.C.E.  

European Journal of Operational Research, Vol. 116, Iss. 1, 1999-07 ,pp. : 183-193

Elsevier

Access to resources Recommend Favorite

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

By Jinjiang Y.  

European Journal of Operational Research, Vol. 94, Iss. 1, 1996-10 ,pp. : 203-205

Elsevier

Access to resources Recommend Favorite