The optimum design of multivariate acceptance sampling plans

A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

Retailer's rationale to refuse consumer returns in supply chains

While accepting consumer returns has long been proposed as a solution to resolve the consumer valuation uncertainty problem, there are still a sizable portion of retailers who insist on a “no return” policy. In this article, we offer an economic rationale for these seemingly unreasonable strategies in a supply chain context. We demonstrate when and why the retailer may benefit from refusing consumer returns, even though offering consumer returns allows the supply chain to implement the expostmarket segmentation. Granting the retailer the right to refuse consumer returns may sometimes improve supply chain efficiency: it eliminates the manufacturer's attempt to induce inefficient consumer returns and bring the equilibrium back to that in the vertically integrated benchmark. We also find that the refund and the retail price can move in the opposite directions when product reliability varies, and consumer returns have a nontrivial impact on the quality choice. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 686–701, 2015     

Can security vetting be extended to include the detection of financial misconduct?

An analysis of the security vetting files of 19 employees within a South African national department who had been found guilty of financial misconduct in the last five years uncovered that the existing security vetting processes did not detect the financial misconduct of which these employees have been found guilty. This research sets out to establish whether security vetting can be extended to include the detection of financial misconduct within the department and, if so, how. Moreover, if security vetting can indeed be so extended, can it possibly enhance the management of fraud risk across all South African public sector departments? Qualitative interviews were conducted with 27 employees who are key to fraud risk management and security vetting within the researched department. During the interviews, the following five themes emerged: (1) the reasons why employees commit financial misconduct; (2) why it is not detected by the security vetting process; (3) the potential alignment of the security vetting process to facilitate the detection of financial misconduct; (4) the following through on security vetting findings; and (5) sharing these findings with the internal audit and risk management functions within state departments. These themes were probed and are reported on, establishing firstly that security vetting can indeed be extended to include the detection of financial misconduct within the researched department, and secondly that it can enhance the management of fraud risk across all South African public sector departments, given the specific mandate of the State Security Agency (SSA) and the national security vetting strategy.     

Impact of reseller's and sales agent's forecasting accuracy in a multilayer supply chain

We consider a three‐layer supply chain with a manufacturer, a reseller, and a sales agent. The demand is stochastically determined by the random market condition and the sales agent's private effort level. Although the manufacturer is uninformed about the market condition, the reseller and the sales agent conduct demand forecasting and generate private demand signals. Under this framework with two levels of adverse selection intertwined with moral hazard, we study the impact of the reseller's and the sales agent's forecasting accuracy on the profitability of each member. We show that the manufacturer's profitability is convex on the reseller's forecasting accuracy. From the manufacturer's perspective, typically improving the reseller's accuracy is detrimental when the accuracy is low but is beneficial when it is high. We identify the concrete interrelation among the manufacturer‐optimal reseller's accuracy, the volatility of the market condition, and the sales agent's accuracy. Finally, the manufacturer's interest may be aligned with the reseller's when only the reseller can choose her accuracy; this alignment is never possible when both downstream players have the discretion to choose their accuracy. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 207–222, 2014