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

Minimizing average completion time in the presence of release dates

By Phillips C.   Stein C.   Wein J.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 199-223

Elsevier

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

Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound

By Huh W.T.   Janakiraman G.   Jackson P.L.   Sawhney N.  

Operations Research Letters, Vol. 31, Iss. 5, 2003-09 ,pp. : 366-374

Elsevier

Access to resources Recommend Favorite

Minimizing coherent risk measures of shortfall in discrete-time models with cone constraints

By Nakano Yumiharu  

Applied Mathematical Finance, Vol. 10, Iss. 2, 2003-06 ,pp. : 163-181

Routledge Ltd

Access to resources Recommend Favorite