Abstract
In this paper we introduce the concept of quality-dependent time slots in the project scheduling literature. Quality-dependent time slots refer to pre-defined time windows where certain activities can be executed under ideal circumstances (optimal level of quality). Outside these time windows, there is a loss of quality due to detrimental effects. The purpose is to select a quality-dependent time slot for each activity, resulting in a minimal loss of quality. The contribution of this paper is threefold. First, we show that an R&D project from the bio-technology sector can be transformed to a resource-constrained project scheduling problem (RCPSP). Secondly, we propose an exact search procedure for scheduling this project with the aforementioned quality restrictions. Finally, we test the performance of our procedure on a randomly generated problem set.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brücker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research 112, 3–41 (1999)
Chen, Y.L., Rinks, D., Tang, K.: Critical path in an activity network with time constraints. European Journal of Operational Research 100, 122–133 (1997)
Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38, 1803–1818 (1992)
Demeulemeester, E., Vanhoucke, M., Herroelen, W.: A random network generator for activity-on-the-node networks. Journal of Scheduling 6, 13–34 (2003)
De Reyck, B., Herroelen, W.: An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research 25, 1–17 (1998)
Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Management Science 15, 550–569 (1969)
Horst, R.: Deterministic methods in constrained global optimization: Some recent advances and new fields of application. Naval Research Logistics 37, 433–471 (1990)
Icmeli, O., Erengüç, S.S.: A branch-and-bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Science 42, 1395–1408 (1996)
Icmeli-Tukel, O., Rom, W.O.: Ensuring quality in resource-constrained project scheduling. European Journal of Operational Research 103, 483–496 (1997)
Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M.: On project scheduling with irregular starting time costs. Operations Research Letters 28, 149–154 (2001)
Schwindt, C.: Minimizing earliness-tardiness costs of resource-constrained projects. In: Inderfurth, K., Schwoediauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Waescher, G. (eds.) Operations Research Proceedings, pp. 402–407. Springer, Heidelberg (1999)
Vanhoucke, M., Demeulemeester, E., Herroelen, W.: An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research 102, 179–196 (2000)
Vanhoucke, M., Demeulemeester, E., Herroelen, W.: On maximizing the net present value of a project under renewable resource constraints. Management Science 47, 1113–1121 (2001)
Vanhoucke, M., Demeulemeester, E., Herroelen, W.: Progress payments in project scheduling problems. European Journal of Operational Research 148, 604–620 (2003)
Yang, H.H., Chen, Y.L.: Finding the critical path in an activity network with time-switch constraints. European Journal of Operational Research 120, 603–613 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vanhoucke, M. (2006). Scheduling an R&D Project with Quality-Dependent Time Slots. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_66
Download citation
DOI: https://doi.org/10.1007/11751595_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)