IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i24p7345-7359.html
   My bibliography  Save this article

Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities

Author

Listed:
  • Fayez F. Boctor

Abstract

This paper deals with the more realistic version of the lot sizing and scheduling problem where we have a single machine that process a number of different products and for each product we have a set of delivery dates and the quantities to deliver at each of these dates. The objective is to minimise the sum of setup costs and inventory holding costs including the holding cost of products from the finish time of each production lot to the next delivery date. In addition, a setup can be carried over from a production run to the immediately succeeding one if the same product is processed during these two runs. A mathematical formulation of this problem is given as well as two specially designed solution heuristics. As the literature does not provide any other method to solve this problem, only the results obtained by these two heuristics are compared.

Suggested Citation

  • Fayez F. Boctor, 2022. "Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities," International Journal of Production Research, Taylor & Francis Journals, vol. 60(24), pages 7345-7359, December.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:24:p:7345-7359
    DOI: 10.1080/00207543.2022.2036853
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2036853
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2036853?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:taf:tprsxx:v:60:y:2022:i:24:p:7345-7359. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.