Abderrahim Bendadou, Yacine Rekik, Rim Kalaï, Zied Jemai
{"title":"A guaranteed service model with continuous review (r,Q) policy","authors":"Abderrahim Bendadou, Yacine Rekik, Rim Kalaï, Zied Jemai","doi":"10.1007/s10479-025-06550-7","DOIUrl":null,"url":null,"abstract":"<div><p>This paper introduces a generalized Guaranteed Service Model (GSM) for production systems that operates under a continuous review inventory control policy (r,Q). The model incorporates dependencies between processing time and order quantity, as well as controllable setup times, offering a more realistic framework for inventory management. The optimization problem is formulated as a non-linear integer programming problem with a non-convex objective function. To solve this, we propose a hybrid approach that combines the Difference of Convex functions Algorithm (DCA) with a heuristic adjustment technique, enabling efficient computation of high-quality solutions. Numerical experiments demonstrate the effectiveness of the proposed method, achieving competitive performance compared to the Baron solver in terms of cost minimization.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"351 1","pages":"883 - 901"},"PeriodicalIF":4.5000,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06550-7","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
This paper introduces a generalized Guaranteed Service Model (GSM) for production systems that operates under a continuous review inventory control policy (r,Q). The model incorporates dependencies between processing time and order quantity, as well as controllable setup times, offering a more realistic framework for inventory management. The optimization problem is formulated as a non-linear integer programming problem with a non-convex objective function. To solve this, we propose a hybrid approach that combines the Difference of Convex functions Algorithm (DCA) with a heuristic adjustment technique, enabling efficient computation of high-quality solutions. Numerical experiments demonstrate the effectiveness of the proposed method, achieving competitive performance compared to the Baron solver in terms of cost minimization.
期刊介绍:
The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications.
In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.