IDEAS home Printed from
   My bibliography  Save this article

Heuristics for the economic lot scheduling problem with returns


  • Teunter, Ruud
  • Tang, Ou
  • Kaparis, Konstantinos


We study the multi-item economic lot scheduling problem (ELSP) with two sources of production: manufacturing of new items and remanufacturing of returned items. Manufacturing and remanufacturing operations are performed on the same production line. Tang and Teunter [2006. Economic lot scheduling problem with returns. Production and Operations Management 15 (4), 488-497.] recently presented a complex algorithm for this problem that determines the optimal solution within the class of policies with a common cycle time and a single (re)manufacturing lot for each item in each cycle. This algorithm is rather complex and time consuming, combining a large MIP formulation with a search procedure, and may therefore not always be practical. In this paper, we deal with this type of problems and propose simple heuristics that are very fast and can be applied in a spreadsheet package. A large numerical study shows that the heuristics provide close to optimal solutions.

Suggested Citation

  • Teunter, Ruud & Tang, Ou & Kaparis, Konstantinos, 2009. "Heuristics for the economic lot scheduling problem with returns," International Journal of Production Economics, Elsevier, vol. 118(1), pages 323-330, March.
  • Handle: RePEc:eee:proeco:v:118:y:2009:i:1:p:323-330

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Samuel G. Davis, 1990. "Scheduling Economic Lot Size Production Runs," Management Science, INFORMS, vol. 36(8), pages 985-998, August.
    2. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    3. Earl E. Bomberger, 1966. "A Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, INFORMS, vol. 12(11), pages 778-784, July.
    4. Richter, Knut, 1996. "The EOQ repair and waste disposal model with variable setup numbers," European Journal of Operational Research, Elsevier, vol. 95(2), pages 313-324, December.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Wang, Gang & Gunasekaran, Angappa, 2017. "Operations scheduling in reverse supply chains: Identical demand and delivery deadlines," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 375-381.
    2. Zolfagharinia, Hossein & Hafezi, Maryam & Farahani, Reza Zanjirani & Fahimnia, Behnam, 2014. "A hybrid two-stock inventory control model for a reverse supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 141-161.
    3. Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.
    4. Sifaleras, Angelo & Konstantaras, Ioannis & Mladenović, Nenad, 2015. "Variable neighborhood search for the economic lot sizing problem with product returns and recovery," International Journal of Production Economics, Elsevier, vol. 160(C), pages 133-143.
    5. Polotski, Vladimir & Kenne, Jean-Pierre & Gharbi, Ali, 2017. "Production and setup policy optimization for hybrid manufacturing–remanufacturing systems," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 322-333.
    6. Holmbom, Martin & Segerstedt, Anders, 2014. "Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems," International Journal of Production Economics, Elsevier, vol. 155(C), pages 82-90.


    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:proeco:v:118:y:2009:i:1:p:323-330. 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: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.