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

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...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 60; no. 24; pp. 7345 - 7359
Main Author Boctor, Fayez F.
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 17.12.2022
Taylor & Francis LLC
Subjects
Delivery scheduling
heuristics
integer programming
Lot sizing
production planning
Scheduling
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2022.2036853