Total completion time minimization in two-machine job shops with unit-time operations

Author： Kubiak W.   Timkovsky V.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.2, 1996-10, pp. : 310-320

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

Bounds for the position of the smallest job in completion time variance minimization

By Manna D.K.   Prasad V.R.  

European Journal of Operational Research, Vol. 114, Iss. 2, 1999-04 ,pp. : 411-419

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

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

By Della Croce F.   Ghirardi M.   Tadei R.  

European Journal of Operational Research, Vol. 139, Iss. 2, 2002-06 ,pp. : 293-301

Elsevier

Access to resources Recommend Favorite

Two-machine flow shops with limited machine availability

By Kubiak W.   Blazewicz J.   Formanowicz P.   Breit J.   Schmidt G.  

European Journal of Operational Research, Vol. 136, Iss. 3, 2002-02 ,pp. : 528-540

Elsevier

Access to resources Recommend Favorite

Stochastically minimizing the makespan in two-machine flow shops without blocking

By Kamburowski J.  

European Journal of Operational Research, Vol. 112, Iss. 2, 1999-01 ,pp. : 304-309

Elsevier

Access to resources Recommend Favorite