A branch and price solution approach for order acceptance and capacity planning in make-to-order operations

Make-to-order (MTO) operations have to effectively manage their capacity to make long-term sustainable profits. This objective can be met by selectively accepting available customer orders and simultaneously planning for capacity. We model a MTO operation of a job-shop with multiple resources having regular and non-regular capacity. The MTO firm has a set of customer orders at time zero with fixed due-dates. The process route, processing times, and sales price for each order are given. Since orders compete for limited resources, the firm can only accept some orders. In this paper a Mixed-Integer Linear Program (MILP) is proposed to aid an operational manager to decide which orders to accept and how to allocate resources such that the overall profit is maximized. A branch-and-price (B&P) algorithm is devised to solve the MILP effectively. The MILP is first decomposed into a master problem and several sub-problems using Dantzig-Wolfe decomposition. Each sub-problem is represented as a network flow problem and an exact procedure is proposed to solve the sub-problems efficiently. We also propose an approximate B&P scheme, Lagrangian bounds, and approximations to fathom nodes in the branch-and-bound tree. Computational analysis shows that the proposed B&P algorithm can solve large problem instances with relatively short time.

[1]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[2]  Mohammad Modarres,et al.  Revenue management approach to stochastic capacity allocation problem , 2009, Eur. J. Oper. Res..

[3]  Scott Webster,et al.  Dynamic Pricing and Lead-Time Policies for Make-to-Order Systems , 2002, Decis. Sci..

[4]  Jonathan P. Pinder,et al.  A revenue management approach to demand management and order booking in assemble-to-order manufacturing , 1995 .

[5]  Willy Herroelen,et al.  Dynamic Order Acceptance and Capacity Planning within a Multi-Project Environment , 2006 .

[6]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[7]  Herbert F. Lewis,et al.  Multi-period job selection: planning work loads to maximize profit , 2002, Comput. Oper. Res..

[8]  Izak Duenyas,et al.  Optimal Admission Control and Sequencing in a Make-to-Stock/Make-to-Order Production System , 2000, Oper. Res..

[9]  Jérémie Gallien,et al.  A Model for Make-To-Order Revenue Management 1 , 2004 .

[10]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[11]  Purushothaman Damodaran,et al.  Scheduling a capacitated batch processing machine using genetic algorithms , 2007 .

[12]  Mehmet Barut,et al.  Design and evaluation of a dynamic capacity apportionment procedure , 2004, Eur. J. Oper. Res..

[13]  Can Akkan Overtime Scheduling: An Application in Finite-capacity Real-time Scheduling , 1996 .

[14]  Chin Sheng Chen,et al.  Concurrent engineer-to-order operation in the manufacturing engineering contracting industries , 2006 .

[15]  Izak Duenyas,et al.  Single facility due date setting with multiple customer classes , 1995 .

[16]  V. Sridharan,et al.  Capacity rationing in multi-period planning environments , 1996 .

[17]  Chao Wang,et al.  The capacity planning problem in make-to-order enterprises , 2009, Math. Comput. Model..

[18]  W. Wilhelm A Technical Review of Column Generation in Integer Programming , 2001 .

[19]  Bahram Alidaee,et al.  Greedy solutions of selection and ordering problems , 2001, Eur. J. Oper. Res..

[20]  Nagraj Balakrishnan,et al.  Robustness of capacity rationing policies , 1999, Eur. J. Oper. Res..

[21]  Mehmet Barut,et al.  Revenue Management in Order-Driven Production Systems , 2005, Decis. Sci..

[22]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[23]  Jose A. Faria,et al.  Multiobjective Optimization Models and solution Methods for Planning land Development using Minimum Spanning Trees, Lagrangian Relaxation and Decomposition Techniques , 2005 .

[24]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[25]  Patrik Jonsson,et al.  Manufacturing Planning and Control , 2009 .

[26]  Nagraj Balakrishnan,et al.  Rationing Capacity Between Two Product Classes , 1996 .

[27]  Anshu Jalora,et al.  Order acceptance and scheduling at a make-to-order system using revenue management , 2006 .

[28]  Paul M. Griffin,et al.  Order selection and scheduling with leadtime flexibility , 2004 .

[29]  Márcio Alexandre Marques,et al.  TOWARDS INTELLIGENT MANUFACTURING , 2007 .

[30]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

[31]  Can Akkan,et al.  Finite-capacity scheduling-based planning for revenue-based capacity management , 1997, Eur. J. Oper. Res..

[32]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[33]  Paul M. Griffin,et al.  Pricing and scheduling decisions with leadtime flexibility , 2006, Eur. J. Oper. Res..

[34]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[35]  Of references. , 1966, JAMA.

[36]  William L. Berry,et al.  Manufacturing Planning and Control Systems , 1984 .

[37]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[38]  Reza Tavakkoli-Moghaddam,et al.  A new decision-making structure for the order entry stage in make-to-order environments , 2008 .

[39]  Marco Zuniga,et al.  A mathematical model for scheduling shipboard crew in cruise lines , 2010 .

[40]  van den Jm Marjan Akker,et al.  A time-indexed formulation for single-machine scheduling problems : column generation , 1996 .

[41]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[42]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[43]  Erwin W. Hans,et al.  Workload based order acceptance in job shop environments , 2005, OR Spectr..

[44]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[45]  Paul Rogers,et al.  Optimal Control of Make-To-Order Manufacturing Systems via Selected Order Acceptance , 2006, Proceedings of the 2006 Winter Simulation Conference.

[46]  Timothy D. Fry,et al.  Capacity-based order review/release strategies to improve manufacturing performance , 1992 .

[47]  Bruce L. Miller,et al.  A Queueing Reward System with Several Customer Classes , 1969 .

[48]  Heinrich Kuhn,et al.  Revenue management for a make-to-order company with limited inventory capacity , 2007, OR Spectr..

[49]  Andres L. Carrano,et al.  Swarm of Microsystem Particles for Multi-Axial Morphogenic Rapid Prototyping , 2005 .

[50]  Douglas R. Moodie,et al.  Pricing and lead time decisions for make-to-order firms with contingent orders , 1999, Eur. J. Oper. Res..

[51]  Purushothaman Damodaran,et al.  Heuristics for minimizing makespan of batch-processing machines in a flowshop , 2008 .

[52]  Velde van de Sl,et al.  A column generation algorithm for common due date scheduling , 1997 .

[53]  Sheldon M. Ross,et al.  The Streetwalker’s Dilemma: A Job Shop Model , 1971 .

[54]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..

[55]  Ronald L. Rardin,et al.  Optimization in operations research , 1997 .