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

Fayez F. Boctor

International Journal of Production Research, 2022, vol. 60, issue 24, 7345-7359

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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2022.2036853 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:60:y:2022:i:24:p:7345-7359

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2022.2036853

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().