Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presen...

Energy expense is becoming increasingly dominant in the operating costs of high-performance computing (HPC) systems. At the same time, electricity prices vary significantly at different times of the day. Furthermore, job power profiles also differ greatly, especially on HPC systems. In this paper, we propose a smart, power-aware job scheduling approach for HPC systems based on variable energy p...

Today’s batch computing systems derive from a job scheduling paradigm. In contrast, utility service environments assign measured quantities of resources to long-running customer activities according to policies for resource matching and allocation. In this paper we explore the duality between job scheduling and utility resource management using a leasing abstraction that generalizes reservation...

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems that can be found in semiconductor manufacturing systems. We describe batch scheduling problems, job shop scheduling problems, scheduling problems with secondary resources, multiple orders per job scheduling problems, and sched...

Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by propos...

Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation based study...

Grid computing is the novel framework that offers a flexible, secure and high performance computing, on demand for solving high compute-intensive applications with large number of independent jobs. However, user jobs developed for grid might be small and of varying lengths according to their computational needs and other requirements. Certainly, it is a real challenge to design an efficient sch...

1Over the past few years, several approaches to scheduling have been proposed that attempt to reduce tardiness and inventory costs by opportunistically (i.e. dynamically) combining resource-centered perspective to schedule bottleneck resources, and a job-centered perspective to schedule non-bottleneck operations on a job by job basis. Rather than relying on their initial bottleneck analysis, th...

This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors e ciently. This paper evaluates the performance of job scheduling schemes that are propose...

In a volunteer-based grid computing environment, one big challenge for effective job allocation is resource availability. As resources in this environment are volatile and may become frequently unavailable, matching guest jobs to suitable resources is very important. To improve scheduling performance in such an unreliable computing environment, especially in terms of avoiding job completion fai...