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.
In the paper, we consider the dynamic, elastic and flexible task scheduling problem in hybrid clouds. Tasks are linearly dependent, compute-intensive, stochastic, deadline-constrained and executed on elastic and distributed cloud resources. The objective is to finish all jobs before their deadlines with renting virtual machines as less as possible. Firstly, we propose two simple and fast dispatching...
Cloud computing enables users to access different resources conveniently based on the ‘pay-as-you-go’ model. However, the unit cost of these on-demand instances are usually high. The spot instances provide a dynamic and cheaper manner for renting resources from the cloud. However, failures are often occurred due to the fluctuations of the price of the spot instance. It is a big challenge to determine...
Cloud has become an attractive computing platform which offers seemly unlimited and computing resources to public. From perspective of data centers which offer cloud services, however, computing resources are limited and operating cost restricts cloud service quality. In order to balance between cost and service quality, the scheduling module, as the core component of the management system of data...
This paper considers the workflow scheduling problem in Clouds with the hourly charging model and data transfer times. It deals with the allocation of tasks to suitable VM instances while maintaining the precedence constraints on one hand and meeting the workflow deadline on the other. A bi-direction adjust heuristic (BDA) is proposed for the considered problem. Matching of tasks and the VM types...
In this paper, a multi-mode project scheduling problem with deadline constraints is considered to minimize the resource availability cost. Modes of each activity are associated with different durations and renewable resources. Three kinds of rules are developed for activity selection, mode assignment, and time decision, respectively. A lot of combinations of the three kind rules are compared and the...
The RCMPSPTT (resource-constrained multi-project scheduling problem with resource transfer time) problem usually exists in distributed collaborative manufacturing systems, in which scarce resources are shared by different projects dispersed in distributed physical places. Resources are needed to be transferred among different projects with non-neglectable time. In this paper, a hybrid genetic algorithm...
In this paper, hatch constrained quay crane scheduling problem is considered to minimize makespan with dual cycling, which can improve efficiency of operations and utilization of quay cranes. By analyzing precedence relationships intra- and inter- hatches, the problem is decomposed into two embedded sub-problems, each of which can be formulated as a 2-machine flow shop scheduling problem. A composite...
No-wait flowshops with flowtime minimization are typical NP-complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in this paper by which the objective of an offspring being obtained just by objective increments and computational...
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.