Process scheduling is a classical problem in the field of production planning and control; in particular, effective job shop scheduling remains an essential component in today’s highly dynamic and agile production environment. This paper presents unified framework for solving generic job shop scheduling problems based on the formulation of a job shop into three main classes of problem, namely, ...

Grid computing is a high performance computing environment to solve larger scale computational applications. Grid computing contains resource management, job scheduling, security problems, information management and so on. Job scheduling is a fundamental and important issue in achieving high performance in grid computing systems. However, it is a big challenge to design an efficient scheduler a...

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

In the area of Computer Science, Parallel job scheduling is an important field of research. Finding a best suitable processor on the high performance or cluster computing for user submitted jobs plays an important role in measuring system performance. A new scheduling technique called communication aware scheduling is devised and is capable of handling serial jobs, parallel jobs, mixed jobs and...

In grid environment, jobs may be scheduled to multiple machines across different administrative domains. However, grid security is a main hurdle to make the job scheduling decision secure, reliable and fault tolerant. A security-aware parallel and independent job scheduling algorithm in grid computing environment based on adaptive job replications was proposed. In risky and failure-prone grids,...

The performance of non-contiguous allocation has been traditionally carried out by means of simulations based on synthetic workloads, and also it can be significantly affected by the job scheduling strategy used for determining the order in which jobs are selected for execution. To validate the performance of the noncontiguous allocation algorithms, there has been a need to evaluate the algorit...

Volunteer grid computing comprises of volunteer resources which are unpredictable in nature and as such the scheduling of jobs among these resources could be very uncertain. It is also difficult to ensure the successful completion of submitted jobs on volunteer resources as these resources may opt to withdraw from the grid system anytime or there might be a resource failure, which requires job ...

The problem of finding good solutions to scheduling problems is very important to real manufacturing systems, since the production rate and production costs are very dependent on the schedules used for controlling the work in the system. Most research in scheduling focuses on optimisation of static problems, where all problem data are known before scheduling starts. However many real world opti...

For more than a decade, scheduling of jobs has been an attractive research subject for researchers. There are several different ways to schedule jobs, and the threads which make them up. As well, the job scheduling is one of the active research fields, where the researchers work to enhance the efficiency of the job scheduling process in a scheduling environment. In existing hybrid techniques, s...

Due to the diverse failures and error conditions in grid environments, node unavailability is increasingly becoming severe and poses great challenges to reliable job scheduling in grid environment. Current job management systems mainly exploit fault recovery mechanism to guarantee the completion of jobs, but sacrificing system efficiency. To address the challenges, in this paper, a node TTF (Ti...