A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

By Conde Eduardo  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1577-1589

Springer Publishing Company

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

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

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

By  

International Journal of Computer Mathematics, Vol. 92, Iss. 5, 2015-05 ,pp. : 873-881

Taylor & Francis Ltd

Access to resources Recommend Favorite

Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

By Guerriero F.   Di Puglia Pugliese L.  

Optimization Methods and Software, Vol. 26, Iss. 2, 2011-04 ,pp. : 295-340

Taylor & Francis Ltd

Access to resources Recommend Favorite