Economic optimization of off-line inspection with inspection errors

In this paper, we find the optimal inspection policy for the production process of a finite batch of items with inspection errors. We study the effects of inspection errors on the optimal solution and determine which unit should be inspected to minimize the expected total costs. We also find the expected number of inspections for a given batch size. Comparisons of total costs are investigated numerically among the cost minimizing policy, the policy of perfect information, and the policy of zero-defects.     

Availability and maintenance modeling for systems subject to dependent hard and soft failures

This paper develops availability and maintenance models for single‐unit systems subject to dependent hard and soft failures. A hard failure stops the system immediately, whereas a soft failure only reduces the performance capacity of the system. Dependence between these 2 types of failures is reflected in the fact that each soft failure directly increases the hazard rate of the hard failure. On the basis of such interaction, we derive recursive equations for the system reliability and availability functions. To detect both types of failures, inspections are executed periodically. Furthermore, we investigate the optimal inspection policy via the minimization of the expected cost per unit time. The applicability of the developed availability and maintenance models is validated by a case study on an electrical distribution system.     

Economic off-line quality control strategy with two types of inspection errors

A commonly used quality control method is to inspect products to identify their quality and to perform the related disposition of acceptance, salvage or rejection based on the findings. While the issue of finding the most economical inspection/disposition policy has been studied for a batch of units produced from an unreliable system, previous studies assumed the inspections to be perfect. In this study, we further extend the inspection/disposition model to consider two types of inspection errors in order to facilitate the adaptation of this economic inspection/disposition model to real world applications. We first describe an inspection/disposition policy for the two types of inspection errors and then obtain the related mathematical formulae. An algorithm is presented for determining the optimal inspection/disposition policy. Finally, numerical examples are given to illustrate the effect of inspection errors on the optimal inspection/disposition policy under the following three quality control policies: cost minimizing, zero-defects and perfect information policy.     

Optimal Control of Some Simple Deterministic Epidemic Models

Using control variables such as the level of medicare programme effort and the level of inoculation programme effort, three simple mathematical models of epidemics are transformed into optimal control problems. These are multi-state problems with the state variables as numbers of infectives and susceptibles and with the objective function being minimization of the total present value of the social or economic costs of infectives and medical controls. The problems are analysed with the framework of the maximum principle to obtain or, at least, partially characterize the optimal policies over time.     

The value function of a transportation problem

We investigate the value of an optimal transportation problem with the maximization objective as a function of costs and vectors of production and consumption. The value is concave in production. For generic costs, the numbers of linearity domains and peak points are independent of costs and consumption. The peak points are determined by an auxiliary assignment problem. The volumes of the linearity domains are independent of costs while their dependence on consumption can be expressed via the multinomial distribution.     

On economically based quality control decisions

A new approach to the problem of quality control is investigated. It is based on the theories and models developed for optimal maintenance policies for equipment subject to stochastic failure. Four alternative sampling/inspection procedures are examined. They are easy to implement, do not require the process operator to compute his own operating decisions, and are capable of finding optimal intervals between successive samplings/inspections. Both fixed and variable costs are included in the models. Relatively efficient algorithms have been developed for finding the optimal quality control procedures; this is due, partially, to the simple form of the objective function.     

A multi-stage and multi-supplier inventory model allowing different order quantities

This paper addresses a multi-stage inventory model that allows different order quantities among the selected suppliers to obtain the optimal solutions. To achieve the objective of the study, the single-objective and multi-objective methods are adopted for suitable real-world applications. With respect to a single-objective method, this paper aims to minimize the total ordering costs, holding costs, and purchasing costs, subject to the price, quality, and capacity. With respect to a multi-objective method, it focuses on cost minimization, as well as quality and capacity maximization. The proposed model not only considers the allocation of different order quantities among the selected suppliers, but also incorporates the multi-stage inventory problem. Furthermore, a numerical example is provided to illustrate the usefulness of the proposed model and a comparative understanding of various methods. In addition, a simulation test is performed to effectively validate the proposed model which outperforms the previous works. Finally, a sensitivity analysis is carried out to investigate the impact of supply chain cost.     

Optimal inventory policies under decreasing cost functions via geometric programming

In this paper, we establish and analyze two economic order quantity (EOQ) based inventory models under total cost minimization and profit maximization via geometric programming (GP) techniques. Through GP, optimal solutions for both models are found and managerial implications on the optimal policy are determined through bounding and sensitivity analysis. We investigate the effects on the changes in the optimal order quantity and the demand per unit time according to varied parameters by studying optimality conditions. In addition, a comparative analysis between the total cost minimization model and the profit maximization model is conducted. By investigating the error in the optimal order quantity of these two models, several interesting economic implications and managerial insights can be observed.     

A fuzzy goal programming approach to integrated loading and scheduling of a batch processing machine

This paper concerns a real-life problem of loading and scheduling a batch-processing machine. The integrated loading and scheduling problem is stated as a multicriteria optimization problem where different types of objectives are included: (1) short-term objectives of relevance to the shop floor, such as throughput maximization and work-in-process inventory minimization, and (2) long-term objectives such as balancing of end product inventory levels and meeting financial targets imposed by the higher production planning level. Two types of uncertainty are considered: (1) uncertainty inherent in loading and scheduling objective targets (goals) such as the allocated budget and end product demand, and (2) uncertainty in importance relations among the objectives. These two types of uncertainty are modelled using fuzzy sets and fuzzy relations, respectively. A fuzzy goal programming model and the corresponding method are developed which handle both fuzzy and crisp goals and fuzzy importance relations among the goals. Numerical examples are given to illustrate the effectiveness of the developed model.     

Cost effective scheduling of imperfect inspections in systems with hidden failures and rescue possibility

Motivated by real-world critical applications such as aircraft, medical devices, and military systems, this paper models non-repairable systems subject to a delay-time failure process involving hidden and fatal failures in two stages during their missions. A hidden failure cannot cause the system to stop functioning while a fatal failure causes the entire system loss. The system undergoes scheduled inspections for detecting the hidden failure. In the case of a positive inspection result, the system main mission is aborted and a rescue operation is started to mitigate the risk of the entire system loss. The inspections are imperfect and may produce false positive and negative failures. We propose probabilistic models for evaluating performance metrics of the system considered, including mission success probability, system survival probability, expected number of inspections during the mission, and total expected losses. Based on the evaluation models, we formulate and solve an optimization problem of finding the optimal inspection schedule on a fixed mission time horizon to minimize the total expected loss. Examples are provided to demonstrate the proposed methodology and effects of key system parameters on system performance and optimization solutions.     

A Simple Dynamic Method for Obtaining Inspection Schedules

A method for obtaining inspection schedules is proposed for situations where it is difficult to quantify the costs associated with inspections and undetected failure, or when these costs vary in time. After each inspection, the next inspection is scheduled so that there is only a small, specified probability that a failure goes undetected for longer than a specified time. Some properties of the inspection times are derived, and numerical illustrations are given for some particular cases.     

Optimal scheduling of non-perfect inspections

^** Corresponding author. Email: romulo.zequeira{at}utt.fr^*** Email: christophe.berenguer{at}utt.fr In this paper, we study the determination of optimal inspectionpolicies when three types of inspections are available: partial,perfect and imperfect. Perfect inspections diagnose withouterror the system state. The system can fail because of threecompeting failure types: I, II and III. Partial inspectionsdetect without error type I failures. Failures of type II canbe detected by imperfect inspections which have non-zero probabilityof false positives. Partial and imperfect inspections are madeat the same time. Type III failures are detectable only by perfectinspections. If the system is found failed in an inspection,a repair is made which renders the system in a good-as-new condition.The system is preventively maintained following an age-basedpolicy. Preventive maintenance actions return the system toa good-as-new condition. We consider cost contributions of inspections,repairs, preventive maintenance and periods of unavailability.The model presented permits to determine the optimal (constant)inter-inspection period for partial, imperfect and perfect inspectionsand the optimal times of preventive maintenance actions.     

Maximizing upgrading and downgrading margins for ordinal regression

In ordinal regression, a score function and threshold values are sought to classify a set of objects into a set of ranked classes. Classifying an individual in a class with higher (respectively lower) rank than its actual rank is called an upgrading (respectively downgrading) error. Since upgrading and downgrading errors may not have the same importance, they should be considered as two different criteria to be taken into account when measuring the quality of a classifier. In Support Vector Machines, margin maximization is used as an effective and computationally tractable surrogate of the minimization of misclassification errors. As an extension, we consider in this paper the maximization of upgrading and downgrading margins as a surrogate of the minimization of upgrading and downgrading errors, and we address the biobjective problem of finding a classifier maximizing simultaneously the two margins. The whole set of Pareto-optimal solutions of such biobjective problem is described as translations of the optimal solutions of a scalar optimization problem. For the most popular case in which the Euclidean norm is considered, the scalar problem has a unique solution, yielding that all the Pareto-optimal solutions of the biobjective problem are translations of each other. Hence, the Pareto-optimal solutions can easily be provided to the analyst, who, after inspection of the misclassification errors caused, should choose in a later stage the most convenient classifier. The consequence of this analysis is that it provides a theoretical foundation for a popular strategy among practitioners, based on the so-called ROC curve, which is shown here to equal the set of Pareto-optimal solutions of maximizing simultaneously the downgrading and upgrading margins.     

A non-cooperative game model for managing a multiple-aged expiring inventory under consumers' heterogeneity to price and time

The considered inventory system includes the coexistence of old and new types belonging to an identical product. A non-cooperative game approach between the retailer and the market, where the retailer aims to increase her profit, is developed. The market, on the other hand, may seek different objectives. In particular, the objectives of price minimization, freshness maximization, and maximization of the quantity on shelf are analyzed. The main objectives are to develop a model of a multiple-aged inventory system and to specify the conditions under which multiple types on the shelf are not beneficial to either the retailer or the market. Using an analytic optimization approach, the optimal response functions of the two players are derived, while with the aid of numerical iterations, the non-cooperative game Nash equilibrium is obtained. The main theoretical result indicates that selling an inventory that simultaneously holds multiple ages is not optimal; that is, both the retailer and consumers lose out from such a situation. This conclusion is general enough to be valid for a market that is heterogeneous with respect to both price sensitivity and sensitivity to the remaining time until expiration. A numerical example and a sensitivity analysis of the key parameters support the conclusions and highlight their importance.     

Project scheduling problem with mixed uncertainty of randomness and fuzziness

Project scheduling problem is to determine the schedule of allocating resources so as to balance the total cost and the completion time. This paper considers project scheduling problem with mixed uncertainty of randomness and fuzziness, where activity duration times are assumed to be random fuzzy variables. Three types of random fuzzy models as expected cost minimization model, (α, β)-cost minimization model and chance maximization model are built to meet different management requirements. Random fuzzy simulations for some uncertain functions are given and embedded into genetic algorithm to design a hybrid intelligent algorithm. Finally, some numerical experiments are given for the sake of illustration of the effectiveness of the algorithm.     

Optimization of a fully adaptive quality and maintenance model in the presence of multiple location and scale quality shifts

This paper presents a new model for the economic-statistical optimization of a Variable-Parameter Shewhart control scheme. The proposed model can be utilized to monitor processes where apart from multiple independent assignable causes, affecting both the mean and variance, failures can also occur. Each time an alarm is issued by the control scheme, preventive maintenance actions are initiated, whereas, corrective maintenance actions are required after a failure. The more realistic assumption of imperfect preventive maintenance actions has been considered. The optimal parameter values are selected through a bi-objective optimization problem formulated by the long-run average cost per time unit minimization, and the long-run expected availability maximization, subject to statistical constraints. A real case example is presented to illustrate the application of the model. An extended numerical investigation is utilized to evaluate the superiority of the proposed model.     

Optimal control of an inventory-production system with state-dependent random yield

In this paper we study a single stage, periodic-review inventory problem for a single item with stochastic demand. The inventory manager determines order sizes according to an order-up-to logic and observes a random yield due to quality problems in the production. We distinguish between two different states of the production process combined with different probabilities to produce a defective unit. In order to improve the production process, periodic inspections are conducted and in case of a failure the machine is repaired. Approximations are developed to evaluate the average cost for a given order-up-to level and a given inspection interval and we illustrate the existence of optimal policy parameters. The approximations are tested in a simulation study and reveal an excellent performance as they lead to near optimal policy parameters. Moreover, we decompose the problem and test different methods to compute the policy parameters either sequentially or separately. Our results show that a joint optimization of the inventory and maintenance policy leads to a better system performance and reduced costs.     

Single machine total tardiness maximization problems: complexity and algorithms

In this paper, we consider some scheduling problems on a single machine, where weighted or unweighted total tardiness has to be maximized in contrast to usual minimization problems. These problems are theoretically important and have also practical interpretations. For the total weighted tardiness maximization problem, we present an NP-hardness proof and a pseudo-polynomial solution algorithm. For the unweighted total tardiness maximization problem with release dates, NP-hardness is proven. Complexity results for some other classical objective functions (e.g., the number of tardy jobs, total completion time) and various additional constraints (e.g., deadlines, weights and/or release dates of jobs may be given) are presented as well.     

The inverse optimal value problem

This paper considers the following inverse optimization problem: given a linear program, a desired optimal objective value, and a set of feasible cost vectors, determine a cost vector such that the corresponding optimal objective value of the linear program is closest to the desired value. The above problem, referred here as the inverse optimal value problem, is significantly different from standard inverse optimization problems that involve determining a cost vector for a linear program such that a pre-specified solution vector is optimal. In this paper, we show that the inverse optimal value problem is NP-hard in general. We identify conditions under which the problem reduces to a concave maximization or a concave minimization problem. We provide sufficient conditions under which the associated concave minimization problem and, correspondingly, the inverse optimal value problem is polynomially solvable. For the case when the set of feasible cost vectors is polyhedral, we describe an algorithm for the inverse optimal value problem based on solving linear and bilinear programming problems. Some preliminary computational experience is reported.Mathematics Subject Classification (1999):49N45, 90C05, 90C25, 90C26, 90C31, 90C60Acknowledgement This research has been supported in part by the National Science Foundation under CAREER Award DMII-0133943. The authors thank two anonymous reviewers for valuable comments.