Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/188403
Authors: 
Sánchez, Ana
Corominas, Albert
Pastor, Rafael
Year of Publication: 
2009
Citation: 
[Journal:] Journal of Industrial Engineering and Management (JIEM) [ISSN:] 2013-0953 [Volume:] 2 [Year:] 2009 [Issue:] 3 [Pages:] 418-436
Abstract: 
This note deals with the problem of minimising the expected sum of quadratic holding and shortage inventory costs when a single, failure-prone machine produces multiple part-types. Shu and Perkins (2001) introduce the problem and, by restricting the set of control policies to the class of prioritised hedging point (PHP) policies, establish simple, analytical expressions for the optimal hedging points provided that the priority ordering of the part-types is given. However, the determination of an optimal priority ordering is left by the authors as an open question. This leaves an embedded sequencing problem which we focus on in this note. We define a lower bound for the problem, introduce a test bed for future developments, and propose three dynamic programming approaches (with or without the lower bound) for determining the optimal priority orderings for the instances of the test bed. This is an initial step in a research project aimed at solving the optimal priority ordering problem, which will allow evaluating the performance of future heuristic and metaheuristic procedures.
Subjects: 
scheduling
cumulative resources
failure-prone machines
prioritised hedging point control
production control
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by-nc/3.0/
Document Type: 
Article
Social Media Mentions:

Files in This Item:
File
Size





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