Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683): Difference between revisions

The multi-mode resource-constrained project scheduling problem with positive discounted cash flows is considered, where the net present value of all cash flows is to be maximized. Four different payment models are studied: lump-sum payment at the end of the project, payment at the completion times of the activities, payments in equal time intervals and progress payments. Two heuristic local search algorithms (one simulated annealing and one tabu search approach) are proposed where solutions are represented by activity and mode lists. Finally, extensive computational results are presented for instances generated by the ProGen project generator.