Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- repec:eee:apmaco:v:251:y:2015:i:c:p:404-422 is not listed on IDEAS
More about this item
Keywordseconomic lot scheduling problem; ELSP; time-varying lot sizes; sequence-independent setup times; lot sizing; sequence-dependent setup times; costs; genetic algorithms; simulated-annealing; ant colony algorithm; ACA; metaheuristics.;
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:ids:eujine:v:1:y:2007:i:2:p:152-181. 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: (Darren Simpson). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .
We have no references for this item. You can help adding them by using this form .