Multi-hop wireless mesh networks (M-WMNs) [Akyildiz, I. F., 2005] are one of the key features of beyond 3G systems because of their flexibility and low-cost deployment. So far, most of existing studies on multi-hop wireless mesh networks have been accomplished based on the IEEE 802.11 ad hoc mode. The IEEE 802.16 working group (WG) specified the IEEE 802.16-2004 standard [IEEE Std. 802.16-2004,...

Recently, Opportunistic Networks (OppNets) are considered to be one of the most attractive developments Mobile Ad Hoc that have arisen thanks development intelligent devices. OppNets characterized by a rough and dynamic topology as well unpredictable contacts contact times. Data is forwarded stored in intermediate nodes until next opportunity occurs. Therefore, achieving high delivery ratio cha...

: This paper proposes a novel niching estimation of distribution algorithm (EDA) based on fuzzy c-means (FCM) clustering for solving the multi-mode resource-constrained project scheduling problem (MRCPSP). FCM clustering is employed to partition the population into niches to avoid premature convergence of the EDA. Then, the niche capacity is determined by Boltzmann scheme according to the adapt...

In automotive R&D projects a major part of development cost is caused by tests which utilize expensive experimental vehicles. In this paper, we introduce an approach for scheduling the individual tests such that the number of required experimental vehicles is minimized. The proposed approach is based on a new type of multi-mode resource-constrained project scheduling model with minimum and maxi...

    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...

In this paper, a metaheuristic solution algorithm for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with discounted cash flows (MRCPSPDC) is proposed. This consists of determining schedule such that completed, maximizing project’s net present value (NPV) while complying delivery deadline. The adaptative bacterial foraging optimization (ABFO) variation original ...

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 is essential in enterprise operations. Not only does it increase working efficiency but also the enterprise’s profit. In the past, there have been studies developing heuristic algorithms to efficiently solve the complicated multi-mode resource constrained project scheduling problem with discounted cash flows (MRCPSPDCF). These obtained solutions are approximate rather than op...

This paper reviews compact continuous-time formulations for the multi-mode resource-constrained project scheduling problem. Specifically, we first point out a serious flaw in an existing start-end-event-based formulation owing to inconsistent mode choices. We propose two options formulate missing constraints and consider equivalent reformulation with sparser constraint matrix. Second, aggregate...