A note on the equivalence of two heuristics to minimize total tardiness

By Alidaee B.   Gopalan S.  

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

Elsevier

Access to resources Recommend Favorite

Single machine earliness-tardiness scheduling with resource-dependent release dates

By Ventura J.A.   Kim D.   Garriga F.  

European Journal of Operational Research, Vol. 142, Iss. 1, 2002-10 ,pp. : 52-69

Elsevier

Access to resources Recommend Favorite

Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times

By Rajendran C.   Ziegler H.  

European Journal of Operational Research, Vol. 149, Iss. 3, 2003-09 ,pp. : 513-522

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

A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times

By Mahnam Mehdi   Moslehi Ghasem  

Engineering Optimization, Vol. 41, Iss. 6, 2009-06 ,pp. : 521-536

Taylor & Francis Ltd

Access to resources Recommend Favorite