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.
Computing efficiently a planning of incoming jobs to available machines in the Grid system is a main requirement for optimized system performance. One version of the problem is that of independent batch scheduling in which jobs are assumed independent and are scheduled in batches aiming to minimize the make span and flow time. Given the hardness of the problem, heuristics are used to find high quality...
The hybridization of heuristics methods has been proposed in the meta-heuristics research community as a way to overcome limitations of single meta-heuristics. Although a priori there is no guarantee that the resulting hybrid heuristic would outperform stand alone heuristics, in general better results can be found for classes of instances of the optimization problem under study. One promising family...
Yard crane scheduling is the vital problem affecting the operational efficiency of container yard directly in the container terminal. This paper addresses yard crane scheduling problem. Firstly the mathematical model of yard crane scheduling is presented, which takes loading time, reshuffling time and waiting time of yard cranes into account. Then the hybrid intelligent algorithm GATS, which is combined...
Tasks scheduling problem is a key factor for a distributed system in order to achieve better efficiency. The problem of tasks scheduling in a distributed system can be stated as allocating tasks to the processor of each computer. The objective of this problem is minimizing makespan and communication cost, while maximizing CPU utilization. Scheduling problem is known as being NP-complete. Hence, many...
In recent time we spot a tendency to use the computing capacity of workstation clusters instead of investing in single machines with tremendous calculation power. Applying this idea we are able to execute multiple jobs paralelly. However, it still remains unclear how to schedule given jobs among available machines most effectively. Therefore this paper is an approach to optimization of mentioned scheduling...
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.