Multi-project scheduling with 2-stage decomposition

Can, Anıl and Ulusoy, Gündüz (2010) Multi-project scheduling with 2-stage decomposition. [Working Paper / Technical Report] Sabanci University ID:SU_FENS_2011/0010

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


A non-preemptive, zero time lag multi-project scheduling problem with multiple modes and limited renewable and nonrenewable resources is considered. A 2-stage decomposition approach is adopted to formulate the problem as a hierarchy of 0-1 mathematical programming models. At stage one, each project is reduced to a macro-activity with macro-modes resulting in a single project network where the objective is the maximization of the net present value and the cash flows are positive. For setting the time horizon three different methods are developed and tested. A genetic algorithm approach is designed for this problem, which is also employed to generate a starting solution for the exact solution procedure. Using the starting times and the resource profiles obtained in stage one each project is scheduled at stage two for minimum makespan. The result of the first stage is subjected to a post-processing procedure to distribute the remaining resource capacities. Three new test problem sets are generated with 81, 84 and 27 problems each and three different configurations of solution procedures are tested.

Item Type:Working Paper / Technical Report
Uncontrolled Keywords:Multiple projects, multiple modes, scheduling, decomposition, genetic algorithms
Subjects:T Technology > TS Manufactures > TS0155-194 Production management. Operations management
ID Code:16945
Deposited By:Gündüz Ulusoy
Deposited On:23 Sep 2011 14:59
Last Modified:30 Jul 2019 09:25

Repository Staff Only: item control page