Two local search approaches for solving real-life car sequencing problems
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Mireille Palpant & Christian Artigues & Philippe Michelon, 2004. "LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search," Annals of Operations Research, Springer, vol. 131(1), pages 237-257, October.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- repec:spr:annopr:v:264:y:2018:i:1:d:10.1007_s10479-017-2663-4 is not listed on IDEAS
- Elahi, Mirza M. Lutfe & Rajpurohit, Karthik & Rosenberger, Jay M. & Zaruba, Gergely & Priest, John, 2015. "Optimizing real-time vehicle sequencing of a paint shop conveyor system," Omega, Elsevier, vol. 55(C), pages 61-72.
- Parames Chutima & Sathaporn Olarnviwatchai, 0. "A multi-objective car sequencing problem on two-sided assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 0, pages 1-20.
More about this item
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:928-944. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .