Un procedimiento de fuerte reducción de las dimensiones del RCPS/Pi

  1. Álvarez-Valdés Olaguíbel, Ramón 1
  2. Crespo, Enric 2
  3. Tamarit Goerlich, José Manuel 1
  4. Villa Juliá, M. Fulgencia 3
  1. 1 Universitat de València, Dep. d’Estadística i Investigació Operativa
  2. 2 Universitat de València, Departament de Matemàtiques per a l’Economia i l’Empresa, Facultat d’Economia
  3. 3 Universidad Politécnica de Valencia, Dep. de Estadística e Investigación Operativa Aplicada y de Calidad
Erakutsi afiliazioak +
Aldizkaria:
Revista de Matemática: Teoría y Aplicaciones

ISSN: 2215-3373,  2215-3373

Argitalpen urtea: 2009

Alea: 16

Zenbakia: 1

Orrialdeak: 188-198

Mota: Artikulua

DOI: 10.15517/RMTA.V16I1.1427 DIALNET GOOGLE SCHOLAR lock_openDialnet editor

Beste argitalpen batzuk: Revista de Matemática: Teoría y Aplicaciones

Laburpena

Recently, in the field of project scheduling problems the concept of partially renewableresources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewableresources allow us to model a large variety of situations that do not fit intoclassical models, but can be found in real problems in timetabling and labour scheduling.When modelling real problems, the problem of project scheduling with partiallyrenewable resources, as many other combinatorial problems, gets such large dimensionsthat it is quite difficult to apply solution procedures. In this paper, we describesome powerful preprocessing techniques that reduce significantly the dimension of theproblems and therefore improve the efficiency of any algorithm used for solving them.The paper shows the excellent results obtained by these techniques on a set of testinstance taken from the literature.Keywords: Project Scheduling, Preprocessing, Partially Renewable Resources.

Erreferentzia bibliografikoak

  • Alvarez-Valdés, R.; Crespo, E.; Tamarit, J.M.; Villa, F. (2006) “GRASP and path relinking for project scheduling under partially renewable resources”, European Journal of Operational Research, en prensa.
  • Alvarez-Valdés, R.; Crespo, E.; Tamarit, J.M.; Villa, F. (2006) “A scatter search algorithm for project scheduling under partially renewable resources”, Journal of Heuristics 12: 95–113.
  • Böttcher, J.; Drexl, A.; Kolisch, R.; Salewski, F. (1999) “Project scheduling under partially renewable resource constraints”, Management Science 45: 544–559.
  • Demeulemeester, E.L.; Herroelen, W.S. (2002) Project Scheduling: A Research Handbook. Kluwer Academic Publishers, Boston.
  • Kolisch, R.; Sprecher, A.; Drexl, A. (1995) “Characterization and generation of a general class of resource-constrained project scheduling problems”, Management Science 41: 1693–1703.
  • Mellentien, C.; Schwindt, C.; Trautmann, N. (2004) “Scheduling the factory pick-up of new cars”, OR Spectrum, in press.
  • Neumann, K.; Schwindt, C.; Trautmann, N. (2002) “Advanced production scheduling for batch plants in process industries”, OR Spectrum 24: 251–279.
  • Neumann, K.; Schwindt, C.; Trautmann, N. (2004) “Scheduling of continuous and discontinuous material flows with intermediate storage restrictions”, European Journal of Operational Research, in press.
  • Schirmer, A. (2000) Project Scheduling with Scarce Resources. Verlag Dr. Kovac, Hamburg.
  • Schwindt, C.; Trautmann, N. (2000) “Scheduling the production of rolling ingots: industrial context, model and solution method”, International Transactions in Operations Research 10: 547–563.
Datuen iturria: Dialnet