Sequencing jobs with random processing times to minimize weighted completion time variance

By Cai X.   Zhou S.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 241-260

Springer Publishing Company

Access to resources Recommend Favorite

A Computation+Communication Load Balanced Loop Partitioning Method for Distributed Memory Systems

By Pande S.   Bali T.  

Journal of Parallel and Distributed Computing, Vol. 58, Iss. 3, 1999-09 ,pp. : 515-545

Academic Press

Access to resources Recommend Favorite

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”

By Tao Jiping   Chao Zhijun   Xi Yugeng  

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 359-362

Springer Publishing Company

Access to resources Recommend Favorite

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

By Crauwels H.A.J.   Potts C.N.   van Wassenhove L.N.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 261-279

Springer Publishing Company

Access to resources Recommend Favorite

Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

By He Cheng   Lin Hao   Wang Xiumei  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 12, Iss. 1, 2014-03 ,pp. : 87-93

Springer Publishing Company

Access to resources Recommend Favorite