Heuristics for scheduling projects with resource restrictions and several resource-duration modes

Boctor, Fayez F.

doi:10.1080/00207549308956882

Cited by 139 publications

(84 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The set is available from the ftp server of the University of Kiel (http://129.187.106.231/psplib/). Results are also compared with a second benchmark dataset taken from Boctor (1993), containing 240 instances with 50 and 100 activities and only renewable resource constraints.…”

Section: Computational Resultsmentioning

confidence: 99%

“…The results show that the new SAT procedure is competitive with the best procedure currently available in the literature and even outperforms it when the running time stop criteria is set to 30 seconds or higher. Finally, Table 1.6 reports results for the dataset of Boctor (1993) as the percentage deviation above the minimal critical path length. The procedure is not able to outperform the state-of-the-art procedures.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

The Multi-Mode Resource-Constrained Project Scheduling Problem

Coelho

Vanhoucke

2014

Handbook on Project Management and Scheduling Vol.1

View full text Add to dashboard Cite

This chapter reports on a new solution approach for the multi-mode resource-constrained project scheduling problem (MRCPSP, MPS|prec|C max ). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource-feasible project schedule with a minimal makespan. The problem type is known to be N P-hard and has been solved using various exact as well as (meta-)heuristic procedures. The new algorithm splits the problem type into a mode assignment and a single mode project scheduling step. The mode assignment step is solved by a satisfiability (SAT) problem solver and returns a feasible mode selection to the project scheduling step. The project scheduling step is solved using an efficient meta-heuristic procedure from literature to solve the resourceconstrained project scheduling problem (RCPSP). However, unlike many traditional meta-heuristic methods in literature to solve the MRCPSP, the new approach executes these two steps in one run, relying on a single priority list. Straightforward adaptations to the pure SAT solver by using pseudo boolean non-renewable resource constraints has led to a high quality solution approach in a reasonable computational time. Computational results show that the procedure can report similar or sometimes even better solutions than found by other procedures in literature, although it often requires a higher CPU time.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Computational Resultsmentioning

confidence: 99%

The Multi-Mode Resource-Constrained Project Scheduling Problem

Coelho

Vanhoucke

2014

Handbook on Project Management and Scheduling Vol.1

View full text Add to dashboard Cite

show abstract

“…These methods start with a subset of activities and schedule a new activity at any stage until all activities are programmed. Bokter [9] studied 21 heuristic scheduling methods to solve the resource-constrained project scheduling problem and finally mentioned their combination as the new heuristic algorithm. In addition, Bokter has suggested more precise heuristic algorithm using critical path method and its calculations.…”

Section: Introductionmentioning

confidence: 99%

A parallel simulated annealing (PSA) for solving project scheduling problem with discounted cash flow policy in pricing strategy of the project suppliers

Nasab

Kaveh

2016

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper Resource-constrained project scheduling problem is known as a NP-Hard problem in literature. In this research, discounted cash flow policy is suggested for the resources-constrained project scheduling problem for the first time while in classic models, it has been assumed that price of the required resources is fixed for performing the activities and resources can be prepared only with one price rate in the market. Goal of this problem is to determine optimal starting time of the project activities considering precedence constraints and the available resources such that the project completion time can be minimized. In order to solve the proposed model, a hybrid algorithm based on two algorithms i.e. genetic and simulated annealing has been suggested. In this method, genetic algorithm has been designed as the main framework of the proposed method and simulated annealing method as a new operator and in order to improve local search of the main algorithm. Since values of the parameters have considerable effect on efficiency of these algorithms, therefore, a new statistical approach based on the stepwise regression has been presented to set the proposed algorithms parameters. Results of the calculations show high efficiency of proposed algorithm in terms of solution time and optimal solutions. Keywords: discount; discounted cash flow; parallel simulated annealing algorithm; pricing; project scheduling Algoritam paralelnog simuliranog žarenja u rješavanju problema programiranja projekta politikom diskontne solventnosti u strategiji određivanja cijene dobavljača projekta Izvorni znanstveni članak Problem programiranja projekta s ograničenim sredstvima u literaturi je poznat kao NP-Hard problem. U ovom istraživanju prvi se puta predlaže politika diskontne solventnosti za rješavanje problema programiranja projekta s ograničenim sredstvima. U klasičnim modelima pretpostavlja se da je cijena potrebnih resursa za izvršenje aktivnosti fiksna i resursi se mogu pripremiti samo po jednoj cijeni na tržištu. Problem je usmjeren na određivanje optimalnog polaznog vremena aktivnosti projekta uzimajući u obzir ograničenja prioriteta i dostupne resurse u svrhu skraćenja vremena završetka projekta. Kako bi se riješio predloženi model predlaže se hibridni algoritam zasnovan na dva algoritma, genetskom i simuliranog žarenja. U toj metodi genetski algoritam služi kao glavni okvir predložene metode a metoda simuliranog žarenja kao novi operater i u svrhu poboljšanja lokalnog pretraživanja glavnog algoritma. Budući da vrijednosti parametara znatno utječu na učinkovitost tih algoritama, daje se novi statistički pristup temeljen na stepenastoj regresiji (stepwise regression) za postavljanje parametara predloženih algoritama. Rezultati proračuna pokazuju visoku učinkovitost predloženog algoritma u odnosu na vrijeme donošenja rješenja i optimalnih rješenja.

show abstract

“…Se conocen las soluciones óptimas para los conjuntos de menos de 30 actividades. Los algoritmos desarrollados se prueban también con el conjunto de Boctor [12], el cual consta de dos conjuntos de problemas, uno con 50 y el otro con 100 actividades con 1, 2 o 4 recursos renovables.…”

Section: Programación De Proyectos Con Recursos Limitados Y Múltiplesunclassified

“…Boctor [12], [13] prueba tres reglas de prioridad para la selección de modos utilizando el esquema paralelo de secuenciación: P-SFM: el modo más corto posible en que puede realizarse una actividad. Un modo factible es aquel que puede ser ejecutado en el periodo actual dadas las disponibilidades de los recursos.…”

Section: Reglas De Prioridad Para La Selección De Modounclassified

Nuevos métodos meta heurísticos para la asignación eficiente, optimizada y robusta de recursos limitados

Posada¹,

Margarita²

View full text Add to dashboard Cite

Heuristics for scheduling projects with resource restrictions and several resource-duration modes

Cited by 139 publications

References 13 publications

The Multi-Mode Resource-Constrained Project Scheduling Problem

The Multi-Mode Resource-Constrained Project Scheduling Problem

A parallel simulated annealing (PSA) for solving project scheduling problem with discounted cash flow policy in pricing strategy of the project suppliers

Nuevos métodos meta heurísticos para la asignación eficiente, optimizada y robusta de recursos limitados

Contact Info

Product

Resources

About