A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
AbstractWe develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as a solution combination method. Computational results on randomly generated problem sets are compared with the best available results indicating the efficiency of the proposed algorithm.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 193 (2009)
Issue (Month): 1 (February)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Project scheduling Heuristic Scatter search Path relinking Time/resource trade-offs;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
- Li, K. Y. & Willis, R. J., 1992. "An iterative scheduling technique for resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 56(3), pages 370-379, February.
- Debels, D & De Reyck, B & Leus, Roel & Vanhoucke, M, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/98396, Katholieke Universiteit Leuven.
- Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
- Yamashita, Denise Sato & Armentano, Vinicius Amaral & Laguna, Manuel, 2006. "Scatter search for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 169(2), pages 623-637, March.
- De Reyck, B & Demeulemeester, Erik & Herroelen, Willy, 1998. "Local search methods for the discrete time/resource trade-off problem in project networks," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/101141, Katholieke Universiteit Leuven.
- Valls, Vicente & Quintanilla, Sacramento & Ballestin, Francisco, 2003. "Resource-constrained project scheduling: A critical activity reordering heuristic," European Journal of Operational Research, Elsevier, vol. 149(2), pages 282-301, September.
- Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
- Demeulemeester, Erik & De Reyck, B & Herroelen, Willy, 2000. "The discrete time/resource trade-off problem in project networks: a branch-and-bound approach," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/101357, Katholieke Universiteit Leuven.
- Liu, Yu-Hsin, 2011. "Incorporating scatter search and threshold accepting in finding maximum likelihood estimates for the multinomial probit model," European Journal of Operational Research, Elsevier, vol. 211(1), pages 130-138, May.
- Tian, Wendi & Demeulemeester, Erik, 2012. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Open Access publications from Katholieke Universiteit Leuven urn:hdl:123456789/371220, Katholieke Universiteit Leuven.
- 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.
- Coelho, José & Vanhoucke, Mario, 2011. "Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers," European Journal of Operational Research, Elsevier, vol. 213(1), pages 73-82, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.