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

By Amaddeo H.F.   Nawijn W.M.   van Harten A.  

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

Elsevier

Access to resources Recommend Favorite

Minimizing the overhead for some tree-scheduling problems

By Bampis E.   Guinand F.   Trystram D.  

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 261-270

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

Heuristic procedures for minimizing makespan and the number of required pallets

By Chengbin C.   Proth J.-M.   Sethi S.  

European Journal of Operational Research, Vol. 86, Iss. 3, 1995-11 ,pp. : 491-502

Elsevier

Access to resources Recommend Favorite

Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge

By Zegordi S.H.   Itoh K.   Enkawa T.  

European Journal of Operational Research, Vol. 85, Iss. 3, 1995-09 ,pp. : 515-531

Elsevier

Access to resources Recommend Favorite