Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

By Baptiste Philippe  

Mathematical Methods of Operations Research, Vol. 60, Iss. 1, 2004-09 ,pp. : 145-153

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing total completion time for UET tasks with release time and outtree precedence constraints

By Huo Yumei   Leung Joseph  

Mathematical Methods of Operations Research, Vol. 62, Iss. 2, 2005-11 ,pp. : 275-279

Springer Publishing Company

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

Reaching the elementary lower bound in the vehicle routing problem with time windows

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 88-99

John Wiley & Sons Inc

Access to resources Recommend Favorite

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time

By Chan Wun-Tat   Chin Francis   Zhang Yong   Zhu Hong   Shen Hong   Wong Prudence  

Journal of Combinatorial Optimization, Vol. 11, Iss. 2, 2006-03 ,pp. : 177-187

Springer Publishing Company

Access to resources Recommend Favorite