IDEAS home Printed from https://ideas.repec.org/p/vlg/vlgwps/2002-19.html
   My bibliography  Save this paper

Optimal due date assignment in project scheduling

Author

Listed:
  • Mario Vanhoucke

    (Vlerick Leuven Gent Management School)

Abstract

In this paper we introduce the concept of due date assignment in the project scheduling literature. Despite the fact that due date assignment problems belongs to the core of the machine scheduling literature, no attempts have been made to tackle this problem in a project scheduling environment. However, of obvious practical importance, an optimal assignment of due dates is of primary interest to the project manager. In a recent research paper on project scheduling with due dates, the problem has been restricted to considering projects with pre-assigned due dates. In reality, due dates are the results of negotiations, rather than simply dictated by the client of the project. In this paper we consider this negotiation process and take a contractor's point of view who faces the problem of assigning due dates to a particular project, based on the negotiation arguments of the client. We show that the problem under study can be solved by means of the combination of different ideas from the operations research community.

Suggested Citation

  • Mario Vanhoucke, 2002. "Optimal due date assignment in project scheduling," Vlerick Leuven Gent Management School Working Paper Series 2002-19, Vlerick Leuven Gent Management School.
    • Handle: RePEc:vlg:vlgwps:2002-19
    as

    Download full text from publisher

    File URL: http://www.vlerick.be/en/2894-VLK/version/default/part/AttachmentData/data/vlgms-wp-2002-19.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "New Benchmark Results for the Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 43(11), pages 1485-1492, November.
    2. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    3. James H. Patterson, 1976. "Project scheduling: The effects of problem structure on heuristic performance," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(1), pages 95-123, March.
    4. James E. Falk & Richard M. Soland, 1969. "An Algorithm for Separable Nonconvex Programming Problems," Management Science, INFORMS, vol. 15(9), pages 550-569, May.
    5. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    6. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    7. Anthony A. Mastor, 1970. "An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques," Management Science, INFORMS, vol. 16(11), pages 728-746, July.
    8. Dale F. Cooper, 1976. "Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation," Management Science, INFORMS, vol. 22(11), pages 1186-1194, July.
    9. Reiner Horst, 1990. "Deterministic methods in constrained global optimization: Some recent advances and new fields of application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 433-471, August.
    10. Richard M. Soland, 1974. "Optimal Facility Location with Concave Costs," Operations Research, INFORMS, vol. 22(2), pages 373-382, April.
    11. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    12. Ulusoy, Gunduz & Cebelli, Serkan, 2000. "An equitable approach to the payment scheduling problem in project management," European Journal of Operational Research, Elsevier, vol. 127(2), pages 262-278, December.
    13. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
    14. W Herroelen & B De Reyck, 1999. "Phase transitions in project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 148-156, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. D. Van den Poel, 2003. "Predicting Mail-Order Repeat Buying. Which Variables Matter?," Review of Business and Economic Literature, KU Leuven, Faculty of Economics and Business (FEB), Review of Business and Economic Literature, vol. 0(3), pages 371-404.
    2. Valls, Vicente & Pérez, Ángeles & Quintanilla, Sacramento, 2009. "Skilled workforce scheduling in Service Centres," European Journal of Operational Research, Elsevier, vol. 193(3), pages 791-804, March.
    3. Quintanilla, Sacramento & Pérez, Ángeles & Lino, Pilar & Valls, Vicente, 2012. "Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres," European Journal of Operational Research, Elsevier, vol. 219(1), pages 59-72.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    2. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    3. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
    4. Bert De Reyck & Erik Demeulemeester & Willy Herroelen, 1998. "Local search methods for the discrete time/resource trade‐off problem in project networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 553-578, September.
    5. Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
    6. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    7. V. Van Peteghem & M. Vanhoucke, 2009. "Using Resource Scarceness Characteristics to Solve the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/595, Ghent University, Faculty of Economics and Business Administration.
    8. Vanhoucke, Mario & Coelho, Jose & Debels, Dieter & Maenhout, Broos & Tavares, Luis V., 2008. "An evaluation of the adequacy of project network generators with systematically sampled networks," European Journal of Operational Research, Elsevier, vol. 187(2), pages 511-524, June.
    9. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    10. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    11. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    12. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    13. Messelis, Tommy & De Causmaecker, Patrick, 2014. "An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 233(3), pages 511-528.
    14. Schirmer, Andreas & Riesenberg, Sven, 1998. "Class-based control schemes for parameterized project scheduling heuristics," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 471, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    16. M. Vanhoucke & J. Coelho & L. V. Tavares & D. Debels, 2004. "On The Morphological Structure Of A Network," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/272, Ghent University, Faculty of Economics and Business Administration.
    17. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    18. Schirmer, Armin, 1998. "Adaptive control schemes for parameterized heuristic scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 488, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vlg:vlgwps:2002-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Isabelle Vandenbroere (email available below). General contact details of provider: https://edirc.repec.org/data/vlgmsbe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.