Abstract
This paper investigates dynamic order acceptance and capacity planning under limited regular and non-regular resources. Our goal is to maximize the profits of the accepted projects within a finite planning horizon. The way in which the projects are planned affects their payout time and, as a consequence, the reinvestment revenues as well as the available capacity for future arriving projects. In general, project proposals arise dynamically to the organization, and their actual characteristics are only revealed upon arrival. Dynamic solution approaches are therefore most likely to obtain good results. Although the problem can theoretically be solved to optimality as a stochastic dynamic program, real-life problem instances are too difficult to be solved exactly within a reasonable amount of time. Efficient and effective heuristics are thus required that supply a response without delay. For this reason, this paper considers both ‘single-pass’ algorithms as well as approximate dynamic-programming algorithms and investigates their suitability to solve the problem. Simulation experiments compare the performance of our procedures to a first-come, first-served policy that is commonly used in practice.
Similar content being viewed by others
References
Akkan, C.: Finite-capacity scheduling-based planning for revenue-based capacity management. Eur. J. Oper. Res. 100, 170–179 (1997)
Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. 1. Athena Scientific (2005)
Bertsekas, D.P., Castañon, D.A.: Rollout algorithms for stochastic scheduling problems. J. Heuristics 5, 89–108 (1999)
Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific (1996)
De Boer, R.: Resource-constrained multi-project management—A hierarchical decision support system. PhD thesis, University of Twente, Enschede, the Netherlands (1998)
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling—A Research Handbook. Kluwer Academic, Dordrecht (2002)
Ebben, M.J., Hans, E.W., Olde Weghuis, F.M.: Workload based order acceptance in job shop environments. OR Spektrum 27, 107–122 (2005)
Herbots, J., Herroelen, W., Leus, R.: Dynamic order acceptance and capacity planning within a multi-project environment. Technical Report KBI 0614, Department of Decision Sciences and Information Management, Katholieke Universiteit Leuven, Belgium (2006)
Herbots, J., Herroelen, W., Leus, R.: Dynamic order acceptance and capacity planning on a single bottleneck resource. Nav. Res. Logist. 54(8), 874–889 (2007)
Herroelen, W., Van Dommelen, P., Demeulemeester, E.: Project network models with discounted cash flows: A guided tour through recent developments. Eur. J. Oper. Res. 100, 97 (1997)
Kis, T.: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math. Programm. 103(3), 515–539 (2005)
Kolisch, R., Meyer, K.: Selection and scheduling of pharmaceutical research projects. In: Perspectives in Modern Project Scheduling, pp. 321–344. Springer, Berlin (2006)
Loch, C.H., Kavadias, S.: Dynamic portfolio selection of NPD programs using marginal returns. Manag. Sci. 48(10), 1227–1241 (2002)
Neumann, K., Schwindt, C., Zimmerman, J.: Project Scheduling with Time Windows and Scarce Resources. Springer, Berlin (2002)
Perry, T.C., Hartman, J.C.: Allocating manufacturing capacity by solving a dynamic, stochastic multiknapsack problem. Technical Report ISE 04T-009, Lehigh University, PA (2004)
Voß, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136, 285–302 (2005)
Weatherford, L.R., Bodily, S.E.: A taxonomy and research overview of perishable-asset revenue management: Yield management, overbooking and pricing. Oper. Res. 40(5), 831–844 (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Herbots, J., Herroelen, W. & Leus, R. Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning. J Heuristics 16, 189–209 (2010). https://doi.org/10.1007/s10732-008-9096-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-008-9096-9