An optimal replenishment policy for items with inventory-level-dependent demand and fixed lifetime under the LIFO policy

In a recent paper, Hwang and Hahn considered inventory replenishment problems for an item with an inventory-level-dependent demand rate and a fixed lifetime. They developed an EQQ model under the situation of considering the first-in–first-out (FIFO) issuing policy. First, this paper reconsiders Hwang and Hann's problem by employing the last-in–first-out (LIFO) issuing policy, which is more practical in the retail industry. An inventory model is developed. Secondly, the concavity of the objective function is proved. Thirdly, this paper presents conditions where the present model has a unique optimal solution and a method for finding the global optimal solution. A simple solution procedure and sensitivity analyses of parameters are also provided.     

An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro

In order to reduce infant mortality in the municipality of Rio de Janeiro it is desired to encourage all mothers-to-be to attend the appropriate health care facilities. A 3-level hierarchical prenatal–neonatal health care system is described together with a basic model for optimising accessibility to facilities. A genetic algorithm to solve the basic model is developed and some numerical experience reported. Extensions to the basic model and planned future research are briefly indicated.     

Machine assignment in a nonlinear multi-product flowline

A group of machines for processing a set of jobs in a manufacturing system is often located in a serial line. An efficient strategy for locating these machines such that the total travel distance or the cost of transporting the jobs is minimized is desired. In this research, the assumption of a linear line with equally spaced machine location is relaxed. This research addressed problems of locating unique machines. It is found that the machine distances possess unique properties in this type of a problem. Utilizing these properties, heuristic strategies are proposed to obtain efficient solution where optimal methods are expected to be computationally prohibitive. A lower bound for the optimum solution is also proposed. Results are encouraging.     

A column generation approach for the timetabling problem of Greek high schools

A column generation (CG) approach for the solution of timetabling problems is presented. This methodology could be used for various instances of the timetabling problem, although in this paper the solution of the high-school situation in Greece is presented. The results obtained show clearly that the CG approach that has been extremely successful in recent years in the solution of airline crew scheduling problems could also be very efficient and robust for the solution of timetabling problems. Several large timetabling problems corresponding to real problems have been successfully solved, with the solutions obtained feasible and of very high quality in accordance with the problem definition. In addition, none of the solutions contained any idle hour for any of the teachers, which was one of the main goals of this optimization effort.     

Tuning inventory policy parameters in a small chemical company

A project to improve inventory management in a small UK chemical company is described. A research group comprising university academics and company managers for logistics and information technology examined current practices and analysed a database of historical records of business operations of the company. Based on the analysis, a scheme to categorise stock and set ordering policies to optimise inventory costs was developed. Some comments are made on process issues and the learning that took place.     

An EOQ model with process reliability considerations

The classical economic order quantity (EOQ) model assumes that items produced are of perfect quality and that the unit cost of production is independent of demand. However, in realistic situations, product quality is never perfect, but is directly affected by the reliability of the production process. In this paper, we consider an EOQ model with imperfect production process and the unit production cost is directly related to process reliability and inversely related to the demand rate. In addition, a numerical example is given to illustrate the developed model. Sensitivity analysis is also performed and discussed.     

Benchmarking state-of-the-art classification algorithms for credit scoring

In this paper, we study the performance of various state-of-the-art classification algorithms applied to eight real-life credit scoring data sets. Some of the data sets originate from major Benelux and UK financial institutions. Different types of classifiers are evaluated and compared. Besides the well-known classification algorithms (eg logistic regression, discriminant analysis, k-nearest neighbour, neural networks and decision trees), this study also investigates the suitability and performance of some recently proposed, advanced kernel-based classification algorithms such as support vector machines and least-squares support vector machines (LS-SVMs). The performance is assessed using the classification accuracy and the area under the receiver operating characteristic curve. Statistically significant performance differences are identified using the appropriate test statistics. It is found that both the LS-SVM and neural network classifiers yield a very good performance, but also simple classifiers such as logistic regression and linear discriminant analysis perform very well for credit scoring.     

Loading aircraft for military operations

In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.