zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. (English) Zbl 1152.90464
Summary: We 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.

MSC:
90B35Scheduling theory, deterministic
WorldCat.org
Full Text: DOI
References:
[1] Alcaraz, J.; Maroto, C.: A robust genetic algorithm for resource allocation in project scheduling, Annals of operations research 102, 83-109 (2001) · Zbl 1024.90036 · doi:10.1023/A:1010949931021
[2] Alcaraz, J.; Maroto, C.; Ruiz, R.: Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms, Journal of the operational research society 54, 614-626 (2003) · Zbl 1095.90541 · doi:10.1057/palgrave.jors.2601563
[3] Alcaraz, J., Maroto, C., Ruiz, R., 2004. Improving the performance of genetic algorithms for the RCPS problem. In: Proceedings of the Ninth International Workshop on Project Management and Scheduling, Nancy, pp. 40 -- 43.
[4] Blazewicz, J.; Lemstra, J. K.; Kan, A. H. G. Rinnooy: Scheduling subject to resource constraints: classification and complexity, Discrete applied mathematics 5, 11-24 (1983) · Zbl 0516.68037 · doi:10.1016/0166-218X(83)90012-4
[5] De Reyck, B.; Demeulemeester, E.; Herroelen, W.: Local search methods for the discrete time/resource trade-off problem in project networks, Naval research logistic quarterly 45, 553-578 (1998) · Zbl 0948.90065 · doi:10.1002/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO;2-1
[6] Debels, D.; De Reyck, B.; Leus, R.; Vanhoucke, M.: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, European journal of operational research 169, 638-653 (2006) · Zbl 1079.90051 · doi:10.1016/j.ejor.2004.08.020
[7] Demeulemeester, E.; Dereyck, B.; Herroelen, W.: The discrete time/resource trade-off problem in project networks: A branch and bound approach, IIE transactions 32, 1059-1069 (2000)
[8] Demeulemeester, E.; Herroelen, W.: Project scheduling: A research handbook, (2002) · Zbl 1059.90068
[9] Glover, F.; Laguna, M.; Marti’, R.: Fundamentals of scatter search and path relinking, Control and cybernetics 39, 653-684 (2000) · Zbl 0983.90077
[10] Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling, Naval research logistics 45, 733-750 (1998) · Zbl 0936.90024 · doi:10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C
[11] Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints, Naval research logistics 49, 433-448 (2002) · Zbl 1013.90062 · doi:10.1002/nav.10029
[12] Jozefowska, J.; Mika, M.; Rozycki, R.; Waligora, G.; Weglarz, J.: Simulated annealing for multi-mode resource constrained project scheduling, Annals of operations research 102, 137-155 (2001) · Zbl 0990.90513 · doi:10.1023/A:1010954031930
[13] Kochetov, Y., Stolyar, A., 2003. Evolutionary local search with variable neighbourhood for the resource constrained project scheduling problem. In: Proceedings of the Third International Workshop of Computer Science and Information Technologies, Russia. · Zbl 1042.90022
[14] Kolisch, R.: Project scheduling under resource constraints -- efficient heuristics for several problem cases, (1995)
[15] Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation, European journal of operational research 90, 320-333 (1996) · Zbl 0916.90151 · doi:10.1016/0377-2217(95)00357-6
[16] Kolisch, R.; Sprecher, A.: PSPLIB -- A project scheduling library, European journal of operational research 96, 205-216 (1997) · Zbl 0947.90587 · doi:10.1016/S0377-2217(96)00170-1
[17] Kolisch, R.; Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update, European journal of operational research 174, 23-37 (2006) · Zbl 1116.90047 · doi:10.1016/j.ejor.2005.01.065
[18] Laguna, M.; Marti’, R.: Scatter search -- methodology and implementations in C, (2003) · Zbl 1041.90074
[19] Li, K. Y.; Willis, R. J.: An iterative scheduling technique for resource-constrained project scheduling, European journal of operational research 56, 370-379 (1992) · Zbl 0825.90536 · doi:10.1016/0377-2217(92)90320-9
[20] Merkle, D.; Middendorf, M.; Schmeck, H.: Ant colony optimization for resource-constrained project scheduling, IEEE transactions on evolutionary computation 6, 333-346 (2002) · Zbl 1044.68784
[21] Nonobe, K.; Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem, Essays and surveys in metaheuristics, 557-588 (2002) · Zbl 1048.90116
[22] Ranjbar, M.; Kianfar, F.: Solving the discrete time/resource trade-off problem with genetic algorithms, Applied mathematics and computation 191, 451-456 (2007) · Zbl 1193.90110 · doi:10.1016/j.amc.2007.02.109
[23] Slowinski, R.: Two approaches to problems of resource allocation among project activities: A comparative study, Journal of the operational research society 31, 711-723 (1980) · Zbl 0439.90042 · doi:10.2307/2581688
[24] Sprecher, A.; Hartmann, S.; Drexl, A.: An exact algorithm for project scheduling with multiple modes, OR spektrum 19, 195-203 (1997) · Zbl 0885.90059 · doi:10.1007/BF01545587
[25] Tormos, P.; Lova, A.: A competitive heuristic solution technique for resource-constrained project scheduling, Annals of operations research 102, 65-81 (2001) · Zbl 1024.90045 · doi:10.1023/A:1010997814183
[26] Tormos, P.; Lova, A.: An efficient multi-pass heuristic for project scheduling with constrained resources, International journal of production research 41, No. 5, 1071-1086 (2003) · Zbl 1038.90038 · doi:10.1080/0020754021000033904
[27] Valls, V.; Quintanilla, M. S.; Ballestin, F.: Resource-constrained project scheduling: A critical reordering heuristic, European journal of operational research 165, 375-386 (2003)
[28] Valls, V.; Ballestin, F.; Quintanilla, M. S.: Justification and RCPSP: A technique that pays, European journal of operational research 165, 375-386 (2005) · Zbl 1066.90045 · doi:10.1016/j.ejor.2004.04.008
[29] Yamashita, D. S.; Armentano, V. A.; Laguna, M.: Scatter search for project scheduling with resource availability cost, European journal of operational research 169, 623-637 (2006) · Zbl 1079.90066 · doi:10.1016/j.ejor.2004.08.019