A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

Author： Blocher J.D.   Chand S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.91, Iss.3, 1996-06, pp. : 456-470

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

A tree search algorithm for the crew scheduling problem

By Beasley J.E.   Cao B.  

European Journal of Operational Research, Vol. 94, Iss. 3, 1996-11 ,pp. : 517-526

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the resource-constrained project scheduling problem

By Brucker P.   Knust S.   Schoo A.   Thiele O.  

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 272-288

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

By Jinliang C.   Kise H.   Matsumoto H.  

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 578-590

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for the two-stage assembly scheduling problem

By Hariri A.M.A.   Potts C.N.  

European Journal of Operational Research, Vol. 103, Iss. 3, 1997-12 ,pp. : 547-556

Elsevier

Access to resources Recommend Favorite

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

By Brandao J.   Mercer A.  

European Journal of Operational Research, Vol. 100, Iss. 1, 1997-07 ,pp. : 180-191

Elsevier

Access to resources Recommend Favorite