The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We address the permutation flow shop scheduling problem with sequence dependent setup times between jobs. Each job has its weight of importance as well as due date. The goal is to find sequence of jobs such that total weighted tardiness of jobs is minimized. Due to NP-Hard complexity of this problem, a hybrid meta-heuristic algorithm based on Harmony Search Algorithm is developed. In the proposed...
Scheduling enables the cloud in balancing the large amount of load present in the system for faster computation. It plays a vital and significant part in the execution of the load in the various heterogeneous systems. The scheduling portrays a selection of resources for the tasks for better resource utilization. This paper differentiates the various load scheduling algorithms applied in the various...
The studied problem is to optimize a production system where these systems have two dedicated processors. The assignment of tasks to these processors is fixed. For this problem, we have three types of tasks. Some tasks must be processed only by the first processor, a few others by the second processor and the remaining tasks need simultaneously both processors. This NP-hard problem requires the use...
An efficient approach to task scheduling algorithm remains a long-standing challenge in cloud computing. In spite of the various scheduling algorithms proposed for cloud environment, those are mostly improvements based on one algorithm. And it's easy to overlook limitations of the algorithm itself. Aiming at characteristics of task scheduling in cloud environment, this paper proposes a task scheduling...
Cloud computing is a provider of dynamic services which offers readily elastic on demand computing resources as per the customer's request in economical way. As there are a lot of requests fabricated by cloud users which are processed by the accessible resources, there exists a need for better and effective scheduling mechanism for efficient allocation of resources. In this paper, a genetic algorithm...
Divisible-load scheduling has become an increasingly important subject in the research of information technologies in recent years. It focuses on finding an efficient scheduling strategy for massive computing in parallel and distributed systems so that the make-span of the workload is minimized. Most existing scheduling models assume that all processors are idle at the beginning of workload assignment...
Grid computing is a collection of geographically heterogeneous distributed computational resources that enables users for sharing data and other computing resources. One of the major challenges in grid computing is how to schedule batch jobs across such an environment with minimum makespan (the finishing time of the last job) and flow time. In this study, a hybrid batch job scheduling method is proposed...
In this paper, we discuss the scheduling problem of assigning jobs on multiple parallel machines with mold constraints. The mold constraint specifies that each job needs to be processed with specific molds on a machine and there is an arbitrary amount for each type of molds. Besides, different machines can mount different molds. Setup time is also considered when a first job in a machine starts or...
Motivated by some cloud computing applications, this paper considers an unrelated parallel-machine scheduling problem under precedence constraints. We mainly propose an efficient genetic algorithm based on a permutation coding. The performances of the proposed algorithm have been compared to an existing greedy search method and to an exact formulation based on a basic integer linear programming. The...
Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems. However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time. This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to...
Cloud computing is the upcoming technology in current day scenario. It has emerged as a solution for providing resources to the consumers in the form of software, infrastructure or platform as a service. Cloud Service Storage enables users to synchronize their files across devices and also allows them to backup online. The main aim of this paper is to provide service optimization. Scheduling of services...
Computing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications distinguish for their demanding needs for CPU computing, independently of the amount of data associated with the problem instance. Among computing intensive applications, there...
In ground station scheduling problem the aim is to compute an optimal planning of communications between Spacecrafts (SCs) and operations teams of Ground Stations (GSs). While such allocation of tasks to ground stations traditionally is mostly done by human intervention, modern scheduling systems look at optimization and automation features. Such features, on the one hand, would increase the efficiency...
Examination scheduling is a very important task that has to be done in all academic institutions periodically. Formulating exam schedules manually requires immense time and effort, due to the presence of a large number of conflicting constraints that must be satisfied. In this study, we tackle the examination scheduling problem that is specific to the female section in our college, and particularly...
In the context of scheduling for multiprocessor computing systems, there have been increasing research interests on algorithms using the Dynamic Voltage Scaling (DVS) technique, which allows processors to operate at lower voltage supply levels at the expense of sacrificing processing speed, to acquire a satisfactory trade-off between quality of schedule and energy consumption. The problem considered...
In public Infrastructure-as-a-Service (IaaS), virtual machines, servers, storage, and network are provided by cloud service providers. As a cloud service provider, who is facing a task for time constraint, how to schedule the service resources to achieve the lowest cost becomes more and more important. Recently, most of works about MapReduce task scheduling are focus on homogeneous MapReduce framework...
Scheduling tasks in a multiprocessor system is found to be a NP-hard problem and a considerable amount of time is used up when it is solved using conventional techniques. Therefore, evolutionary algorithms like Genetic Algorithms (GA) have been explored for scheduling tasks in a multiprocessor system. GA can be implemented in various manners. This paper investigates the performance of GA with two...
In order to have escalation in the throughput of LTE-Advanced network, carrier aggregation (CA) is employed for meeting the requirement set by International Telecommunication Union (ITU). Within the context of CA, component carrier (CC) selection and scheduling is the most critical task and has significant impact on the network performance. In this study, we propose a self-organized downlink resource...
The fusion of artificial fish algorithm and genetic algorithm is proposed to optimize the flight scheduling of two-runway in large airport in which the problems are difficult, inefficient and serious flight delays. First, in this paper, the shortcomings of artificial fish algorithm and genetic algorithm are analyzed, and combing the advantages of two algorithms, optimization algorithm is proposed...
The problem of scheduling independent users' jobs to resources in Grid Computing systems is of paramount importance. This problem is known to be NP-hard, and many techniques have been proposed to solve it, such as heuristics, genetic algorithms (GA), and, more recently, particle swarm optimization (PSO). This article aims to use PSO to solve grid scheduling problems, and compare it with other techniques...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.