Accelerating Benders decomposition approach for robust aggregate production planning of products with a very limited expiration date. (October 2016)

• Record Type: Journal Article
• Authors: Makui, Ahmad; Heydari, Mahdi; Aazami, Adel; Dehghani, Ehsan
• Is Part Of: Computers & industrial engineering. Volume 100(2016)
• Page Start: 34
• Page End: 51
• Publication Date: 2016-10
• Subjects: Aggregate production planning -- Robust optimization -- Benders decomposition -- Limited expiration date -- Postponement policy; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2016.08.005
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: This Paper proposes an aggregate production planning model for products with a very limited expiration date. The demands and costs of production and inventory are assumed to be uncertain with multiple scenarios. Our proposed model is a robust one and the Benders decomposition algorithm is used to solve it. Abstract: The price of products with a very limited expiration date reduces dramatically after a certain period, say a season. Thus, overproduction or deficiency of such products will end in loss of profit. This study determines aggregate production planning (APP) of products with a very limited expiration date, such as seasonal clothing, New Year gifts, yearbooks and calendars using postponement policy with uncertain conditions. In order to apply the concept of postponement for these products, three types of production activities including direct production, semi-finished production and final assembly are taken into account. Additionally, a robust optimization model is expanded to deal with the inherent uncertainty of the model parameters. Moreover, since the proposed problem is NP-hard, a Benders decomposition algorithm is developed by using two efficient acceleration inequalities to tackle large-scale computational complexity. Finally, a set of real data from a calendar producing company in Tehran called "NIK Calendar" are used to validate the model and show the efficiency as well as convergence of the developed Benders decomposition algorithm. The computational results clearly show efficiency and effectiveness of the devised algorithm.