An optimal online algorithm for single machine scheduling to minimize total general completion time

By Liu Ming  

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 189-195

Springer Publishing Company

Access to resources Recommend Favorite

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

By Batsyn Mikhail   Goldengorin Boris   Pardalos Panos M.   Sukhov Pavel  

Optimization Methods and Software, Vol. 29, Iss. 5, 2014-09 ,pp. : 955-963

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

By Ng C.T.   Cheng T.C.E.   Yuan J.J.   Liu Z.H.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 323-326

Elsevier

Access to resources Recommend Favorite

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

By Brucker Peter   Kravchenko Svetlana  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 2, 2006-06 ,pp. : 143-165

Springer Publishing Company

Access to resources Recommend Favorite

On-line machine scheduling with batch setups

By Zhang Lele   Wirth Andrew  

Journal of Combinatorial Optimization, Vol. 20, Iss. 3, 2010-10 ,pp. : 285-306

Springer Publishing Company

Access to resources Recommend Favorite