![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
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.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Data availability statement
Data used in this paper are available upon a simple request.
Additional information
Funding
Notes on contributors
Fayez F. Boctor
Fayez Boctor is a professor in the operations and decision systems department at Laval University, Canada. He joined Laval University in 1986 after 10 years in Aix-Marseille University. He received a B.Sc. in mechanical engineering, a M. Sc. in industrial engineering, a Ph. D. and a D.Sc. in production management. His current research interests are in transportation systems design and management, heuristics design and analysis, supply chain management, project scheduling, and lot-sizing and scheduling. He is the author and co-author of numerous journal articles in these fields. He was associate editor for IJPR, CJAS and IIE transactions.