Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Scheduling an R&D Project with Quality-Dependent Time Slots

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Article  Google Scholar 

  2. 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)

    Article  MATH  Google Scholar 

  3. Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38, 1803–1818 (1992)

    Article  MATH  Google Scholar 

  4. Demeulemeester, E., Vanhoucke, M., Herroelen, W.: A random network generator for activity-on-the-node networks. Journal of Scheduling 6, 13–34 (2003)

    Article  MathSciNet  Google Scholar 

  5. 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)

    Article  MATH  Google Scholar 

  6. Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Management Science 15, 550–569 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  7. Horst, R.: Deterministic methods in constrained global optimization: Some recent advances and new fields of application. Naval Research Logistics 37, 433–471 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Article  MATH  Google Scholar 

  9. Icmeli-Tukel, O., Rom, W.O.: Ensuring quality in resource-constrained project scheduling. European Journal of Operational Research 103, 483–496 (1997)

    Article  MATH  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Article  MathSciNet  Google Scholar 

  13. 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)

    Article  Google Scholar 

  14. Vanhoucke, M., Demeulemeester, E., Herroelen, W.: Progress payments in project scheduling problems. European Journal of Operational Research 148, 604–620 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics and Business Administration, Ghent University, Gent, Belgium

    Mario Vanhoucke

  2. Operations & Technology Management Centre, Vlerick Leuven Gent Management School, Gent, Belgium

    Mario Vanhoucke

Authors
  1. Mario Vanhoucke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation