Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions

Author： Bart H.   Kroon L.G.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.91, Iss.1, 1996-05, pp. : 144-159

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 functions of infeasibilities in a two-machine flow shop

By Lushchakova I.N.  

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 380-393

Elsevier

Access to resources Recommend Favorite

A bicriteria approach to the two-machine flow shop scheduling problem

By Sayin S.   Karabati S.  

European Journal of Operational Research, Vol. 113, Iss. 2, 1999-03 ,pp. : 435-449

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

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

By Kravchenko S.A.  

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 101-107

Elsevier

Access to resources Recommend Favorite

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G.   Strusevich V.A.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite