Narrow Results

Resource sharing is an important issue for almost all applications. In this paper, we study communication link sharing strategies for application level scheduler on grids as well as heterogeneous and distributed characteristics. We assume that the link is shared via time-sharing or proportional-sharing. We build solution to solve this problem by linear programming, in rational numbers, which can be solved in polynomial time. Our preliminary results show that time-sharing scheme may achieve better performance than that of proportional-sharing.

In this paper, we study the problem of scheduling a set of independent tasks onto parallel systems, with the objective to find a mapping of all tasks such that the finish time is minimum. We develop an improved local search algorithm which shortens the makespan greatly. Extensively experiments verify the power of our algorithm.

The Flow Shop Scheduling Problem (FSSP) is a problem that is commonly found by master production scheduling planners in Flexible Manufacturing Systems (FMS). The planner should find the optimal scheduling to carry out a set of jobs in order to satisfy the predefined objective (e.g., makespan). All the jobs are processed in a production line composed of a set of shared machines. Furthermore, the jobs are processed in the same sequence. In order to be able to analyze this problem in a better way, this problem needs to be represented adequately for understanding the relationship among the operations that are carried out. Thus, an FMS presenting the FSSP can be modeled by Petri nets (PNs), which are a powerful tool that has been used to model and analyze discrete event systems. Then, the makespan can be obtained by simulating the PN through the token game animation. In this work, we propose a new way to calculate the makespan of FSSP based on timed place PNs.