On the minimization of total weighted flow time with identical and uniform parallel machines

Author： Azizoglu M.   Kirca O.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.113, Iss.1, 1999-02, pp. : 91-100

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Minimizing makespan subject to minimum total flow-time on identical parallel machines

By Gupta J.N.D.   Ruiz-Torres A.J.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 370-380

Elsevier

Access to resources Recommend Favorite

Flowshop scheduling with identical jobs and uniform parallel machines

By Dessouky M.M.   Dessouky M.I.   Verma S.K.  

European Journal of Operational Research, Vol. 109, Iss. 3, 1998-09 ,pp. : 620-631

Elsevier

Access to resources Recommend Favorite

A flexible flowshop problem with total flow time minimization

By Azizoglu M.   Cakmak E.   Kondakci S.  

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 528-538

Elsevier

Access to resources Recommend Favorite

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

By Timkovsky V.G.  

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 355-376

Elsevier

Access to resources Recommend Favorite

Preemptive scheduling on identical parallel machines subject to deadlines

By Azizoglu M.  

European Journal of Operational Research, Vol. 148, Iss. 1, 2003-07 ,pp. : 205-210

Elsevier

Access to resources Recommend Favorite