A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment

Publisher： Elsevier

ISSN： 0377-2217

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

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 branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

By Heilmann R.

European Journal of Operational Research, Vol. 144, Iss. 2, 2003-01 ,pp. : 348-365

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 procedure for the resource-constrained project scheduling problem with generalized precedence relations

By De Reyck B. Herroelen W.

European Journal of Operational Research, Vol. 111, Iss. 1, 1998-11 ,pp. : 152-174

Elsevier

Access to resources Recommend Favorite

The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops

By Ouenniche J. Boctor F.F.

European Journal of Operational Research, Vol. 129, Iss. 3, 2001-03 ,pp. : 539-554

Elsevier

Access to resources Recommend Favorite

The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

By Ahn T. Erenguc S.S.

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

Elsevier

Access to resources Recommend Favorite