Jean-Philippe Gayon

Optimal control of a production-inventory system with customer impatience

We consider the control of a production-inventory system with impatient customers. We show that the optimal policy can be described using two thresholds: a production base-stock level that determines when production takes place and an admission threshold that determines when orders should be accepted. We describe an algorithm for computing the performance of the system for any choice of base-stock level and admission threshold. In a numerical study, we compare the performance of the optimal policy against several other policies.

Stock rationing in an M/E r /1 multi-class make-to-stock queue with backorders

A model of a single-item make-to-stock production system is presented. The item is demanded by several classes of customers arriving according to Poisson processes with different backorder costs. Item processing times have an Erlang distribution. It is shown that certain structural properties of optimal stock and capacity allocation policies exist for the case where production may be interrupted and restarted. Also, a complete characterization of the optimal policy in the case of uninterrupted production when excess production can be diverted to a salvage market is presented. A heuristic policy is developed and assessed based on the results obtained in the analysis. Finally the value of production status information and the effects of processing time variability are investigated. [Supplemental materials are available for this article. Go to the publishers online edition of IIE Transactions for the following free supplemental resource: Appendix]

Optimal pricing and production policies of a make-to-stock system with fluctuating demand

We study the effects of different pricing strategies available to a production–inventory system with capacitated supply, which operates in a fluctuating demand environment. The demand depends on the environment and on the offered price. For such systems, three plausible pricing strategies are investigated: static pricing, for which only one price is used at all times, environment-dependent pricing, for which price changes with the environment, and dynamic pricing, for which price depends on both the current environment and the stock level. The objective is to find an optimal replenishment and pricing policy under each of these strategies. This article presents some structural properties of optimal replenishment policies and a numerical study that compares the performances of these three pricing strategies.

Control of a production-inventory system with returns under imperfect advance return information

We consider a production–inventory system with product returns that are announced in advance by the customers. Demands and announcements of returns occur according to independent Poisson processes. An announced return is either actually returned or cancelled after a random return lead time. We consider both lost sale and backorder situations. Using a Markov decision formulation, the optimal production policy, with respect to the discounted cost over an infinite horizon, is characterized for situations with and without advance return information. We give insights in the potential value of this information. Also some attention is paid to combining advance return and advance demand information. Further applications of the model as well as topics for further research are indicated.

On the optimal control of manufacturing and remanufacturing activities with a single shared server

We consider a single-product make-to-stock manufacturing–remanufacturing system. Returned products require remanufacturing before they can be sold. The manufacturing and remanufacturing operations are executed by the same single server, where switching from one activity to another does not involve time or cost and can be done at an arbitrary moment in time. Customer demand can be fulfilled by either newly manufactured or remanufactured products. The times for manufacturing and remanufacturing a product are exponentially distributed. Demand and used products arrive via mutually independent Poisson processes. Disposal of products is not allowed and all used products that are returned have to be accepted. Using Markov decision processes, we investigate the optimal manufacture–remanufacture policy that minimizes holding, backorder, manufacturing and remanufacturing costs per unit of time over an infinite horizon. For a subset of system parameter values we are able to completely characterize the optimal continuous-review dynamic preemptive policy. We provide an efficient algorithm based on quasi-birth–death processes to compute the optimal policy parameter values. For other sets of system parameter values, we present some structural properties and insights related to the optimal policy and the performance of some simple threshold policies.

The aircraft ground routing problem: Analysis of industry punctuality indicators in a sustainable perspective

The ground routing problem consists in scheduling the movements of aircraft on the ground between runways and parking positions while respecting operational and safety requirements in the most efficient way. We present a Mixed Integer Programming (MIP) formulation for routing aircraft along a predetermined path. This formulation is generalized to allow several possible paths. Our model takes into account the classical performance indicators of the literature (the average taxi and completion times) but also the main punctuality indicators of the air traffic industry (the average delay and the on time performance). Then we investigate their relationship through experiments based on real data from Copenhagen Airport (CPH). We show that the industry punctuality indicators are in contradiction with the objective of reducing taxi times and therefore pollution emissions. We propose new indicators that are more sustainable, but also more relevant for stakeholders. We also show that alternate path cannot improve the performance indicators.

Exact and heuristic approaches to the airport stand allocation problem

The Stand Allocation Problem (SAP) consists in assigning aircraft activities (arrival, departure and intermediate parking) to aircraft stands (parking positions) with the objective of maximizing the number of passengers/aircraft at contact stands and minimizing the number of towing movements, while respecting a set of operational and commercial requirements. We first prove that the problem of assigning each operation to a compatible stand is NP-complete by a reduction from the circular arc graph coloring problem. As a corollary, this implies that the SAP is NP-hard. We then formulate the SAP as a Mixed Integer Program (MIP) and strengthen the formulation in several ways. Additionally, we introduce two heuristic algorithms based on a spatial and time decomposition leading to smaller MIPs. The methods are tested on realistic scenarios based on actual data from two major European airports. We compare the performance and the quality of the solutions with state-of-the-art algorithms. The results show that our MIP-based methods provide significant improvements to the solutions outlined in previously published approaches. Moreover, their low computation makes them very practical.

A MAKE-TO-STOCK QUEUE WITH PRODUCT RETURNS

Abstract We consider a production-inventory system with limited production capacity and product returns. More precisely, the system is modelled by an M / M /1 make-to-stock queue which allows us to model explicitly the capacity constraint. Demands are backlogged and returns arrive according to a Poisson process. We address the infinite horizon problem with the objective of minimizing total expected discounted cost or its time average value. For both discounted and average cost problems, the optimal policy is shown to be of base-stock type and the optimal base-stock level is computed analytically. Finally, numerical results show the sensitivity of the average cost to the return rate when the return ratio is small and the demand rate is close to the production rate.

Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand

This work deals with the continuous time lot-sizing inventory problem when demand and costs are time-dependent. We adapt a cost balancing technique developed for the periodic-review version of our problem to the continuous-review framework. We prove that the solution obtained costs at most twice the cost of an optimal solution. We study the numerical complexity of the algorithm and generalize the policy to several important extensions while preserving its performance guarantee of two. Finally, we propose a modified version of our algorithm for the lot-sizing model with some restricted settings that improves the worst-case bound.

Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales

We consider the One Warehouse Multi-Retailer (OWMR) problem with deterministic time-varying demand in the case where shortages are allowed. Demand may be either backlogged or lost. We present a simple combinatorial algorithm to build an approximate solution from a decomposition of the system into single-echelon subproblems. We establish that the algorithm has a performance guarantee of 3 for the OWMR with backlog under mild assumptions on the cost structure. In addition, we improve this guarantee to 2 in the special case of the Joint-Replenishment Problem (JRP) with backlog. As a by-product of our approach, we show that our decomposition provides a new lower bound of the optimal cost. A similar technique also leads to a 2-approximation for the OWMR problem with lost-sales. In all cases, the complexity of the algorithm is linear in the number of retailers and quadratic in the number of time periods, which makes it a valuable tool for practical applications. To the best of our knowledge, these are the first constant approximations for the OWMR with shortages.