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

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

By Chen Bo   Deng Xiaotie   Zang Wenan  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 85-95

Springer Publishing Company

Access to resources Recommend Favorite

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

By Hoogeveen J.A.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 415-433

Academic Press

Access to resources Recommend Favorite

A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data

By Montemanni Roberto  

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 2, 2007-06 ,pp. : 287-296

Springer Publishing Company

Access to resources Recommend Favorite