The network nodes that are connected by wireless data connections called as wireless networks. The devices are connected via wireless link to communicate with each other. In wireless networks, it is very difficult to maintain the trade-off between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route f...

Established techniques like the Critical Path Method and Linear Scheduling Method are activity centered and exhibit schedules statically, which impedes their ability to plan and control projects holistically. Scheduling therefore should be enhanced by incorporating new capabilities of measuring and displaying the dynamic nature of projects. In another technical field that employs a time-space c...

The planning of Manufacturing Systems involves frequently the resolution of a huge amount and variety of combinatorial optimization problems with a important impact on the performance of manufacturing organizations. The proposed approach is in line with reality and away from the approaches that deal with static and classic or basic Job-Shop scheduling problems. In fact, in real world, where pro...

The paper considers the dynamic job shop scheduling problem (DJSSP) with job release dates which arises widely in practical production systems. The principle characteristic of DJSSP considered in the paper is that the jobs arrive continuously in time and the attributes of the jobs, such as the release dates, routings and processing times are not known in advance, whereas in the classical job sh...

We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and s...

Static and dynamic scheduling methods have attracted a lot of attention in recent years. Among these, dynamic scheduling techniques handle scheduling problems where the scheduler does not possess detailed information about the jobs, which may arrive at the shop at any time. In this paper, an intelligent agent based dynamic scheduling system is proposed. It consists of two independent components...

Hardward/software (HW/SW) codesign and reconfigurable computing are commonly used methodologies for digitalsystems design. However, no previous work has been carried out in order to define a HW/SW codesign methodology with dynamic scheduling for run-time reconfigurable architectures. In addition, all previous approaches to reconfigurable computing multicontext scheduling are based on static-sch...

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the s...

When solving scheduling problems a crucial task is the selection or creation of the appropriate scheduling algorithm. An approach is presented that combines the use of meta-scheduling knowledge to select the appropriate strategy and the use of dynamic scheduling knowledge for the flexible creation of scheduling algorithms. The method is based on the decomposition of scheduling algorithms into t...