This is Part II of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part II are twofold. (i) First, we extend the problem formulation, theoretical results, and algorithms to the case of time-varying channels, where opportunistic c...

in this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. in this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. in other words, there is a dictated ready date as well as a d...

Many scheduling problems in project management, manufacturing, and elsewhere require the generation of activity networks to test proposed solution methods. Single-network generators have been used for the resourceconstrained project scheduling problem (RCPSP). Since the first single-network generator was proposed in 1993, several advances have been reported in the literature. However, these gen...

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

Although a large number of studies have been made on modelling a multi-project scheduling problem, little is known about proposing a process which calls for the issues of project creation and selection, resource planning and project scheduling. Project advancement (PA) is a new approach involving such concepts. Seven-step rules of engaging the problem with constrained multi-tasking environment ...

In this paper we demonstrate how decentralized multi-project scheduling problems can be solved efficiently by a group of project manager agents playing a simple sequence learning game. In the multi-project scheduling problem, multiple projects, each having a number of activities, must be scheduled. A set of local and global resources are available for carrying out the activities of the projects...

In industry, many problems are considered as the Decentralized Resource-Constrained Multi-Project Scheduling Problem (DRCMPSP). Existing approaches encounter difficulties in dealing with large problems while preserving information privacy of project agents. In this paper, we propose a novel approach to solve DRCMPSP based on the multi-unit combinatorial auction, which can efficiently solve the ...

The time - cost tradeoff problem is one of the most critical issues in the project scheduling field and so far, a lot of research has been done with a variety of quantitative and qualitative approaches on this subject. In this research, we intend to provide a two - objective mathematical model which balances crash and delay for activities. So that it provides the right tools for decision makers...