Journal•ISSN: 0894-069X
Naval Research Logistics
Wiley-Blackwell
About: Naval Research Logistics is an academic journal published by Wiley-Blackwell. The journal publishes majorly in the area(s): Job shop scheduling & Heuristics. It has an ISSN identifier of 0894-069X. Over the lifetime, 2038 publications have been published receiving 57493 citations. The journal is also known as: Naval Research Logistics, NRL & NRL.
Papers published on a yearly basis
Papers
More filters
TL;DR: This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration and a classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models.
Abstract: A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models.
768 citations
TL;DR: In this paper, an effective center-of-gravity heuristic is presented that outperforms heuristics from the literature for orienteering, a sport in which start and end points are specified along with other locations.
Abstract: Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature.
713 citations
TL;DR: This paper considers the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective and proposes a new genetic algorithm approach to solve this problem that makes use of a permutation based genetic encoding that contains problem-specific knowledge.
Abstract: In this paper we consider the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective. We propose a new genetic algorithm approach to solve this problem. Subsequently, we compare it to two genetic algorithm concepts from the literature. While our approach makes use of a permutation based genetic encoding that contains problem-specific knowledge, the other two procedures employ a priority value based and a priority rule based representation, respectively. Then we present the results of our thorough computational study for which standard sets of project instances have been used. The outcome reveals that our procedure is the most promising genetic algorithm to solve the RCPSP. Finally, we show that our genetic algorithm yields better results than several heuristic procedures presented in the literature. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 733–750, 1998
551 citations
TL;DR: In this paper, the authors demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the using of a moving average forecast.
Abstract: An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two-stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. c 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269{286, 2000
451 citations
TL;DR: In this paper, the authors examined and extended these models using game theory concepts and showed that the non-cooperative approach yields a unique efficiency decomposition under multiple intermediate measures, while the centralized approach is likely to yield multiple decompositions.
Abstract: Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two-stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two-stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 55: 643-653, 2008
433 citations