Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-to-Order Operations

The increasing emphasis on mass customization, shortened product lifecycles, synchronized supply chains, when coupled with advances in information system, is driving most firms towards make-to-order (MTO) operations. Increasing global competition, lower profit margins, and higher customer expectations force the MTO firms to plan its capacity by managing the effective demand. The goal of this research was to maximize the operational profits of a make-to-order operation by selectively accepting incoming customer orders and simultaneously allocating capacity for them at the sales stage. For integrating the two decisions, a Mixed-Integer Linear Program (MILP) was formulated which can aid an operations manager in an MTO environment to select a set of potential customer orders such that all the selected orders are fulfilled by their deadline. The proposed model combines order acceptance/rejection decision with detailed scheduling. Experiments with the formulation indicate that for larger problem sizes, the computational time required to determine an optimal solution is prohibitive. This formulation inherits a block diagonal structure, and can be decomposed into one or more sub-problems (i.e. one sub-problem for each customer order) and a master problem by applying Dantzig-Wolfe’s decomposition principles. To efficiently solve the original MILP, an exact Branch-and-Price algorithm was successfully developed. Various approximation algorithms were developed to further improve the runtime. Experiments conducted unequivocally show the efficiency of these algorithms compared to a commercial optimization solver. The existing literature addresses the static order acceptance problem for a single machine environment having regular capacity with an objective to maximize profits and a penalty for tardiness. This dissertation has solved the order acceptance and capacity planning problem for a job shop environment with multiple resources. Both regular and overtime resources is considered. The Branch-and-Price algorithms developed in this dissertation are faster and can be incorporated in a decision support system which can be used on a daily basis to help make intelligent decisions in a MTO operation

COLUMN GENERATION MODELS FOR OPTIMAL PACKAGE TOUR COMPOSITION

Our work aims to introduce a combinatorial optimization problem orbiting in Revenue Management, called Package Tour Composition (PTC) and to discuss its resolution with a mathematical programming method called column generation method. The classic Network Revenue Management problem considers a set of resources of finite capacity to be allocated to a set of products characterized by a given price and a given demand. The models of Network Revenue Management are applied by airline companies in order to decide how many seats to allocate on each flight leg (resource) to each fare (product) that is characterized by origin, destination and fare class. The model we propose aims to deal with a similar problem in which the demand is not expressed towards a set of products but towards a set of resources. This problem arises, for instance, in the composition of package tours where customer preferences towards events that compose a package tour are more relevant, and easier to be traced, than customer preferences for the whole package. In the PTC problem customers buy products that are bundles of resources in combinations under various terms and conditions. However demand is linked to resources not to products. The resource composition of each product is a decision variable. As a consequence product price is not known but is the sum of reservation prices of each resource in the bundle. The resource set is partitioned into several subsets corresponding to different resource types. A parameter states how many resources of each type characterize each product type. We refer to resources as 'events' and to products as 'package tours' or simply 'packages'. The resulting Package Tour Composition problem is a non-linear problem with integer variables that represent the number of tourists assigned to each package tour and binary variables that represent which events are assigned to each package tour. Each event is characterized by a reservation price, a demand and a capacity. Each package tour belongs to a package tour type that is characterized by its event type composition parameter. The number of tourists assigned to each event cannot exceed its actual capacity, which is defined as the minimuml value between the event capacity and the event demand. We also impose that the binary variables respect the composition constraint for every package tour according to its type. The objective function to be maximized is the total revenue, that is the number of packages to be sold times their price. We propose a column generation model to solve the linear relaxation of the Package Tour Composition problem. The Column Generation technique splits the problem in two sub-problems: the pricing problem and the master problem. The pricing problem dynamically generates, for every package type, several columns containing an event combination according to the package type composition parameter. The master problem chooses which event combinations to use and in which quantity, imposing that event actual capacity is respected, in order to maximize revenue. Chapter 1 concerns the motivation of our research. At first we analyze the previous literature on the theory of Revenue Management focusing our attention on the most important mathematical models that tackle two main Revenue Management problems: Single Resource Capacity Control and Network Capacity Control. We analyze the assumptions of these models to find improvement directions. After that, we present the state-of-the-art of mathematical models applied to tourist operators industry, in particular in the composition of tour itineraries. We propose a taxonomy to classify several possible Package Tour Composition problem formulations. In Chapter 2 the Package Tour Composition Model is formally defined and we propose the application of Column Generation method and a Column generation heuristics method to determine an optimal solution to the linear relaxation problem and a rounded solution to the integer problem. Two formulations are compared: the integer master formulation and the binary master formulation. Thereafter we present the dataset description and we display the results of integer and binary master formulations. In Chapter 3 we illustrate several extensions of the basic models. The extensions take into account market segmentation, inconvenience costs, tourist groups and stochastic demand. For each extension we present computational results obtained with the state-of-the-art mathematical programming solver CPLEX. Finally Chapter 4 presents some conclusions and possible future research directions

Revenue management approach to stochastic capacity allocation problem

To formulate stochastic capacity allocation problems in a manufacturing system, the concept and techniques of revenue management is applied in this research. It is assumed the production capacity is stochastic and hence its exact size cannot be forecasted in advance, at the time of planning. There are two classes of "frequent" and "occasional" customers demanding this capacity. The price rate as well as the penalty for order cancellation caused by overbooking is different for each class. The model is developed mathematically and we propose an analytical solution method. The properties of the optimal solution as well as the behavior of objective function are also analyzed. The objective function is not concave, in general. However, we prove it is a unimodal function and by taking advantage of this property, the optimal solution is determined.Revenue management Capacity allocation Stochastic capacity Optimization