Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/246380 
Year of Publication: 
2019
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 6 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2019 [Pages:] 1-10
Publisher: 
Elsevier, Amsterdam
Abstract: 
To stay competitive in present-day turbulent business environment, managers of manufacturing firms must achieve crucial operational goals, such as maintaining product quality, reducing operating costs, and attaining customer satisfaction. In real manufacturing systems, allowing backordering sometimes can be an effective strategy to help smooth manufacturing schedules and lower operating costs. However, the consequence of excessive shortages is the undesirable service level which reduces customer satisfaction and goodwill. To cope with this unwanted result, a maximal permitted backlogging level is set as an operating constraint to achieve the minimum required service level. Also, production of scrap items and stochastic breakdown are both inevitable in the manufacturing processes. Motivated by addressing aforementioned issues and providing insight information to managers for supporting their operational decision makings, this paper investigates the optimal runtime for a fabrication system with backordering, service level constraint, stochastic breakdown, and scrap. Mathematical model was developed and optimization methods are used to decide the optimal runtime that minimizes total system costs. Various key insights relating to joint impacts of backlogging, service level, stochastic breakdown, and scrap on the optimal runtime decision are revealed through a numerical illustration along with sensitivity analyses.
Subjects: 
Production planning
Runtime decision
Stochastic breakdown
Backlogging
Scrap
Service level constraints
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.