Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows

Author： Salomon M.   Solomon M.M.   Van Wassenhove L.N.   Dumas Y.   Dauzere-Peres S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.100, Iss.3, 1997-08, pp. : 494-513

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

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

Scheduling a flowline manufacturing cell with sequence dependent family setup times

By Schaller J.E.   Gupta J.N.D.   Vakharia A.J.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 324-339

Elsevier

Access to resources Recommend Favorite

Scheduling jobs on parallel machines with sequence-dependent setup times

By Young H.L.   Pinedo M.  

European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. : 464-474

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. 104, Iss. 1, 1998-01 ,pp. : 262-264

Elsevier

Access to resources Recommend Favorite