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

Author： Wagner B.J.   Davis D.J.  

Publisher： Elsevier

ISSN： 0377-2217

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

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 divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times

By Gendreau M.   Laporte G.   Guimaraes E.M.  

European Journal of Operational Research, Vol. 133, Iss. 1, 2001-08 ,pp. : 183-189

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

A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

By Sun J. U.  

Engineering Optimization, Vol. 41, Iss. 6, 2009-06 ,pp. : 505-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

Audit scheduling with overlapping activities and sequence-dependent setup costs

By Dodin B.   Elimam A.A.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 22-33

Elsevier

Access to resources Recommend Favorite