project scheduling   net present value   we consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. in this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a time ...

a common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. as a result, project managers are often unable to meet the deadline time of the milestones. robust project scheduling is an effective approach in case of uncertainty. upon adopting this approach, schedules are protected against po...

Projects became part of the daily business in many functional areas, across industries and services. Despite variety project execution implementation different domains it is visible that projects are sharing fundamental similiarities. Based on experiment success a exuecution depends - next to maintained data quality follow-up ability schedule activities an optimized way. Scheduling even more co...

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent prob...

    Project scheduling   Net present value   We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...