Dynamic order acceptance and capacity planning in a stochastic multi-project environment with a bottleneck resource

We study the integration of order acceptance and capacity planning in multi-project environments with dynamically arriving projects. We model this planning problem as a continuous-time Markov decision process to determine long-term optimal decisions. We examine whether macro-process planning should be performed before or after order acceptance. We characterise the structure of optimal policies, and explore the dependence on a number of parameters such as project payoff, project cost and order arrival time. We also look into the effects of set-up costs and the use of non-regular capacity.

[1]  U Dave,et al.  Critical Chain , 1998, J. Oper. Res. Soc..

[2]  Nicky D. van Foreest,et al.  Scheduling and order acceptance for the customised stochastic lot scheduling problem , 2010 .

[3]  Fariborz Maseeh,et al.  Some New Applications of P-P Plots , 2018 .

[4]  Fabrice Talla Nobibon,et al.  Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment , 2011, Comput. Oper. Res..

[5]  Yves De Serres,et al.  Simultaneous optimization of flow-control and scheduling in a single server queue with two job classes: Numerical results and approximation , 1991, Comput. Oper. Res..

[6]  Rainer Kolisch,et al.  Scheduling of multiple R&D projects in a dynamic and stochastic environment , 2009 .

[7]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[8]  Jwm Will Bertrand,et al.  Production control in engineer-to-order firms , 1993 .

[9]  P. Naor.  The Regulation of Queue Size by Levying Tolls , 1969 .

[10]  Willy Herroelen,et al.  A hierarchical approach to multi-project planning under uncertainty , 2004 .

[11]  Reza H. Ahmadi,et al.  Concurrent Crashing and Overlapping in Product Development , 2004, Oper. Res..

[12]  José Niño-Mora.  Stochastic Scheduling , 2009, Encyclopedia of Optimization.

[13]  W. H. M. Zijm,et al.  Towards intelligent manufacturing planning and control systems , 2000, OR Spectr..

[14]  Yves De Serres,et al.  Simultaneous optimization of flow control and scheduling in a single server queue with two job classes , 1991, Oper. Res. Lett..

[15]  Whm Henk Zijm,et al.  Order acceptance strategies in a production-to-order environment with setup times and due-dates , 1992 .

[16]  Keith W. Ross,et al.  Optimal circuit access policies in an ISDN environment: a Markov decision approach , 1989, IEEE Trans. Commun..

[17]  Shaler Stidham,et al.  A survey of Markov decision models for control of networks of queues , 1993, Queueing Syst. Theory Appl..

[18]  Christoph H. Loch,et al.  Dynamic Portfolio Selection of NPD Programs Using Marginal Returns , 2002, Manag. Sci..

[19]  Boaz Golany,et al.  Managing multi-project environments through constant work-in-process , 2003 .

[20]  P. Whittle.  Restless Bandits: Activity Allocation in a Changing World , 1988 .

[21]  James R. Freeland,et al.  Recent progress in modeling R&D project-selection processes , 1992 .

[22]  Avraham Shtub,et al.  Multi-Project Scheduling and Control: A Process-Based Comparative Study of the Critical Chain Methodology and Some Alternatives , 2004 .

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

[24]  Stylianos Kavadias,et al.  OPTIMAL PROJECT SEQUENCING WITH RECOURSE AT A SCARCE RESOURCE , 2009 .

[25]  Christoph H. Loch,et al.  Selecting R&D projects at BMW: a case study of adopting mathematical programming models , 2001, IEEE Trans. Engineering Management.

[26]  Jan Riezebos,et al.  Order sequencing and capacity balancing in synchronous manufacturing , 2011 .

[27]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[28]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[29]  Sean P. Meyn.  Control Techniques for Complex Networks: Workload , 2007 .

[30]  Uri Yechiali,et al.  On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process , 1971, Oper. Res..

[31]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..

[32]  Jonathan F. Bard,et al.  An interactive approach to R&D project selection and termination , 1988 .

[33]  E. B. Berman,et al.  Resource Allocation in a PERT Network Under Continuous Activity Time-Cost Functions , 1964 .

[34]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[35]  V. Cristina Ivanescu,et al.  A hybrid policy for order acceptance in batch process industries , 2006, OR Spectr..

[36]  Rainer Kolisch,et al.  Markov-Decision-Process-based Scheduling of Multiple Projects in a Stochastic Dynamic Environment , 2010 .

[37]  U. Yechiali.  Customers' Optimal Joining Rules for the GI/M/s Queue , 1972 .

[38]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[39]  El-Houssaine Aghezzaf,et al.  Integrating order acceptance decisions with flexible due dates in a production planning model with load-dependent lead times , 2015 .

[40]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[41]  M. I. McManus.  Optimum use of overtime in post offices , 1977, Comput. Oper. Res..

[42]  Willy Herroelen,et al.  Dynamic order acceptance and capacity planning on a single bottleneck resource , 2007 .

[43]  Philipp Melchiors.  Dynamic and Stochastic Multi-Project Planning , 2015 .

[44]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem with Random Sized Items , 2001, Oper. Res..

[45]  E. Feinberg,et al.  OPTIMALITY OF TRUNK RESERVATION FOR AN M/M/K/N QUEUE WITH SEVERAL CUSTOMER TYPES AND HOLDING COSTS , 2011, Probability in the Engineering and Informational Sciences.

[46]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[47]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[48]  Niels Chr. Knudsen.  Individual and Social Optimization in a Multiserver Queue with a General Cost-Benefit Structure , 1972 .

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

[50]  Donald F. Rossin,et al.  Overtime schedules for full-time service workers , 1997 .

[51]  V. Cristina Ivanescu,et al.  Makespan estimation and order acceptance in batch process industries when processing times are uncertain , 2002, OR Spectr..

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

[53]  Paul S. Adler,et al.  From project to process management: an empirically-based framework for analyzing product development time , 1995 .

[54]  T. B. Crabill.  Optimal Control of a Service Facility with Variable Exponential Service Times and Constant Arrival Rate , 1972 .

[55]  Dimitri P. Bertsekas,et al.  Approximate Dynamic Programming , 2017, Encyclopedia of Machine Learning and Data Mining.

[56]  Stefan Haeussler,et al.  Successful implementation of an order release mechanism based on workload control: a case study of a make-to-stock manufacturer , 2018, Int. J. Prod. Res..