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

Author： Ouenniche J.   Boctor F.F.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

The use of genetic algorithms to solve the economic lot size scheduling problem

By Khouja M.   Michalewicz Z.   Wilmot M.  

European Journal of Operational Research, Vol. 110, Iss. 3, 1998-11 ,pp. : 509-524

Elsevier

Access to resources Recommend Favorite

A search heuristic for the sequence-dependent economic lot scheduling problem

By Wagner B.J.   Davis D.J.  

European Journal of Operational Research, Vol. 141, Iss. 1, 2002-08 ,pp. : 133-146

Elsevier

Access to resources Recommend Favorite

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

By Shanker K.   Modi B.K.  

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

Elsevier

Access to resources Recommend Favorite

A hybrid heuristic and linear programming approach to multi-product machine scheduling

By Goncalves J.F.   Leachman R.C.  

European Journal of Operational Research, Vol. 110, Iss. 3, 1998-11 ,pp. : 548-563

Elsevier

Access to resources Recommend Favorite

The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability

By Bruggemann W.   Jahnke H.  

European Journal of Operational Research, Vol. 124, Iss. 3, 2000-08 ,pp. : 511-528

Elsevier

Access to resources Recommend Favorite