Geodesic
New greedy heuristics for the scheduling problem with limited resources
Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 12-36.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2005_12_1_a1,
     author = {Yu. A. Kochetov and A. A. Stolyar},
     title = {New greedy heuristics for the scheduling problem with limited resources},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {12--36},
     publisher = {mathdoc},
     volume = {12},
     number = {1},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/}
}
TY  - JOUR
AU  - Yu. A. Kochetov
AU  - A. A. Stolyar
TI  - New greedy heuristics for the scheduling problem with limited resources
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2005
SP  - 12
EP  - 36
VL  - 12
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/
LA  - ru
ID  - DA_2005_12_1_a1
ER  - 
%0 Journal Article
%A Yu. A. Kochetov
%A A. A. Stolyar
%T New greedy heuristics for the scheduling problem with limited resources
%J Diskretnyj analiz i issledovanie operacij
%D 2005
%P 12-36
%V 12
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/
%G ru
%F DA_2005_12_1_a1
Yu. A. Kochetov; A. A. Stolyar. New greedy heuristics for the scheduling problem with limited resources. Diskretnyj analiz i issledovanie operacij, Tome 12 (2005) no. 1, pp. 12-36. http://geodesic.mathdoc.fr/item/DA_2005_12_1_a1/

[1] Gimadi E. Kh., Zalyubovskii V. V., Sevastyanov S. V., “Polinomialnaya razreshimost zadach kalendarnogo planirovaniya s ogranichennymi resursami i direktivnymi srokami”, Diskret. analiz i issled. operatsii. Ser. 2, 7:1 (2000), 9–34 | MR | Zbl

[2] Kochetov Yu. A., Stolyar A. A., “Ispolzovanie chereduyuschikhsya okrestnostei dlya priblizhennogo resheniya zadachi kalendarnogo planirovaniya s ogranichennymi resursami”, Diskret. analiz i issled. operatsii. Ser. 2, 10:2 (2003), 29–55 | MR | Zbl

[3] Stolyar A. A., “Zadacha kalendarnogo planirovaniya s ogranichennymi resursami: issledovanie okrestnostei dlya lokalnogo poiska”, Trudy XII Baikalskoi mezhdunarodnoi konferentsii, T. 6, Izd-vo IrGU, Irkutsk, 2001, 46–50

[4] Alcaraz J., Maroto C., “A robust genetic algorithm for resource allocation in project scheduling”, Ann. Oper. Res., 102 (2001), 83–109 | DOI | MR | Zbl

[5] Alcaraz J., Maroto C., Ruiz R., “Improving the performance of genetic algorithms for the RCPS problem”, Proc. of the Ninth International Workshop on Project Management and Scheduling, Nancy, 2004, 40–43

[6] Baar T., Brucker P., Knust S., “Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem”, Meta-heuristics. Advances and trends in local search paradigms for optimization, Kluwer Acad. Publ., Dordrecht, 1999, 1–18 | MR | Zbl

[7] Bla.{z}ewicz J., Lenstra J. K., Rinnooy Kan A. H. G., “Scheduling subject to resource constraints: classification and complexity”, Discrete Appl. Math., 5:1 (1983), 11–24 | DOI | MR | Zbl

[8] Bouleimen K., Lecocq H., “A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple modes version”, Eur. J. Oper. Res., 149:2 (2003), 268–281 | DOI | MR | Zbl

[9] Coelho J., Tavares L., Comparative analysis of meta-heuristics for the the resource constrained project scheduling problem, Techn. Rep. Department of Civil Engineering, Instituto Superior Tecnico, Portugal, 2003

[10] Debels D., DeReyck B., Leus R., Vanhoucke M., “A hybrid scatter search/electromagnetism meta-heuristic for project scheduling”, Eur. J. Oper. Res. (to appear) | Zbl

[11] Feo T. A., Resende M. G. C., “Greedy randomized adaptive search procedures”, J. Global Optim., 6 (1995), 109–133 | DOI | MR | Zbl

[12] Festa P., Resende M. G. C., “GRASP: An annotated bibliography”, Essays and surveys in metaheuristics, Kluwer Acad. Publ., Boston, 2002, 325–368 | MR

[13] Hartmann S., “Self-adapting genetic algorithm for project scheduling under resource constraints”, Naval Res. Logist, 49 (2002), 433–448 | DOI | MR | Zbl

[14] Kochetov Yu., Stolyar A., “Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem”, Proc. of 3th Intern. Workshop of Computer Science and Information Technologies, Russia, 2003, 96–99

[15] Kolisch R., “Efficient priority rules for the resource-constrained project scheduling problem”, J. Oper. Management., 14:3 (1996), 179–192 | DOI

[16] Kolisch R., “Serial and parallel resource-constrained project scheduling methods revisited: theory and computation”, Eur. J. Oper. Res., 90:2 (1996), 320–333 | DOI | Zbl

[17] Kolisch R., Drexl A., “Adaptive search for solving hard project scheduling problems”, Naval Res. Logist., 43:1 (1996), 23–40 | 3.0.CO;2-P class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | Zbl

[18] Kolisch R., Hartmann S., “Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis”, Project scheduling: recent models, algorithms and applications, Kluwer Acad. Publ., Boston, 1999, 147–178

[19] Kolisch R., Schwindt C., Sprecher A., “Benchmark instances for project scheduling problems”, Project scheduling: recent models, algorithms and applications, Kluwer Acad. Publ., Boston, 1999, 197–212

[20] Kolisch R., Sprecher A., Drexl A., “Characterization and generation of a general class of resource-constrained project scheduling problems”, Management Sci., 41 (1995), 1693–1703 | DOI | Zbl

[21] Li R.-Y., Willis J., “An iterative scheduling technique for resource-constrained project scheduling”, Eur. J. Oper. Res., 56:3 (1992), 370–379 | DOI | Zbl

[22] Martello S., Toth P., Knapsack problems. Algorithms and computer implementations, John Wiley Sons, Chichester, 1990 | MR | Zbl

[23] Merkle D., Middendorf M., Schmeck H., “Ant colony optimization for resource-constrained project scheduling”, IEEE Trans. on Evolutionary Computation, 6:4 (2002), 333–346 | DOI | MR

[24] Möhring R. H., Schulz A. S., Stork F., Uetz M., “Solving project scheduling problems by minimum cut computations”, Management Sci., 49:3 (2003), 330–350 | DOI

[25] Nonobe K., Ibaraki T., “Formulation and tabu search algorithm for the resource constrained project scheduling problem”, Essays and surveys in metaheuristics, Kluwer Acad. Publ., Boston, 2002, 557–588 | MR | Zbl

[26] Özdamar L., Ulusoy G., “An iterative local constraint based analysis for solving the resource-constrained project scheduling problem”, J. Oper. Management., 14:3 (1996), 193–208 | DOI

[27] Schirmer A., “Case-based reasoning and improved adaptive search for project scheduling”, Naval Res. Logist., 47:3 (2000), 201–222 | 3.0.CO;2-L class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl

[28] Tormos P., Lova A., “A competitive heuristic solution techniques for resource-consrtained project scheduling”, Ann. Oper. Res., 102 (2001), 65–81 | DOI | MR | Zbl

[29] Tormos P., Lova A., “An efficient multi-pass heuristic for project scheduling with consrtained resourcs”, Internat. J. Production Research, 41:5 (2003), 1071–1086 | DOI | Zbl

[30] Tormos P., Lova A., Integrating heuristics for resource-consrtained project scheduling: One step forward, Techn. Rep. Department of Statistics and Operations Research, Universidad Politecnica de Valencia, 2003

[31] Valls V., Ballestin F., Quintanilla S., A hybrid genetic algorithm for the RCPSP, Techn. Rep. Department of Statistics and Operation Research, University of Valencia, 2003

[32] Valls V., Ballestin F., Quintanilla S., “Justification and RCPSP: A technique that pays”, Eur. J. Oper. Res., 165:2 (2005), 375–386 | DOI | MR | Zbl

[33] Yannakakis M., “Computational Complexity”, Local search in combinatorial optimization, John Wiley Sons, Chichester, 1997, 19–55 | MR