Search results

Resource scheduling is the study of how to effectively measure, evaluate, analyze, and dispatch resources in order to meet the demands of corresponding tasks. Aiming at the problem of resource scheduling in the private cloud environment, the purpose of this paper is to propose a resource scheduling approach from an efficiency priority point of view.

To measure the computational efficiencies for the resource nodes in a private cloud environment, the data envelopment analysis (DEA) approach is incorporated and a suitable DEA model is proposed. Then, based on the efficiency scores calculated by the proposed DEA model for the resource nodes, the 0-1 programming technique is introduced to build a simple resource scheduling model.

The proposed DEA model not only has the ability of ranking all the decision-making units into different positions but also can handle non-discretionary inputs and undesirable outputs when evaluating the resource nodes. Furthermore, the resource scheduling model can generate for the calculation tasks an optimal resource scheduling scheme that has the highest total computational efficiency.

The proposed method may also be used in studies of resource scheduling studies in the environments of public clouds and hybrid clouds.

The proposed approach can achieve the goal of resource scheduling in private cloud computing platforms by attaining the highest total computational efficiency, which is very significant in practice.

This paper uses an efficiency priority point of view to solve the problem of resource scheduling in private cloud environments.

Historically, scheduling of production activities has been one of the most important management problems. Scheduling involves the planning and the co‐ordination of the various activities to achieve the optimum utilisation of resources over a given time period. Production scheduling differs with the typology of the production systems. Various production systems that are encountered in practice are: continuous production, mass production, batch production, job shop production and projects. In this article, we attempt only to discuss the project scheduling problems.

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling.

The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems.

In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation.

This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects.

The purpose of this paper is to examine how certain limitations of the current approaches to planning and scheduling of aircraft heavy maintenance can be addressed using a single integrated framework supported by unified data structures.

The “unitary structuring technique”, originally developed within the context of manufacturing planning and control, is further enhanced for aircraft heavy maintenance applications, taking into account the uncertainty associated with condition‐based maintenance. The proposed framework delivers the advanced functionalities required for simultaneous and dynamic forward planning of maintenance operations, as well as finite loading of resources, towards optimising the overall maintenance performance.

Execution of maintenance operations under uncertainty involves materials changes, rectification and re‐assembly. It is shown that re‐scheduling of materials (spare‐parts), resources and operations can be taken care of by simultaneous and dynamic forward planning of materials and operations with finite loading of resources, using the integrated framework.

As part of adopting the proposed framework in practice, it needs to be guided by an overall methodology appropriate for application‐specific contexts.

The potential direct benefits of adopting the proposed framework include on‐time project completion, reduced inventory levels of spare‐parts and reduced overtime costs.

Existing approaches to aircraft maintenance planning and scheduling are limited in their capacity to deal with contingencies arising out of inspections carried out during the execution phase of large maintenance projects. The proposed integrated approach is, capable of handling uncertainty associated with condition‐based maintenance, due to the added functionalities referred to above.

Today, with the rapid growth of cloud computing (CC), there exist several users that require to execute their tasks by the available resources to obtain the best performance, reduce response time and use resources. However, despite the significance of the scheduling issue in CC, as far as the authors know, there is not any systematic and inclusive paper about studying and analyzing the recent methods. This paper aims to review the current mechanisms and techniques, which can be addressed in this area.

The central purpose of this paper refers to offering a complete study of the state-of-the-art planning algorithms in the cloud and also instructions for future research. Besides, this paper offers a methodological analysis of the scheduling mechanisms in the cloud environment.

The central role of this paper is to present a summary of the present issues related to scheduling in the cloud environment, providing a structure of some popular techniques in cloud scheduling scope and defining key areas for the development of cloud scheduling techniques in the future research.

In this paper, scheduling mechanisms are classified into two main categories include deterministic and non-deterministic algorithms; however, it can also be classified into different categories. In addition, the selection of all related papers could not be ensured. It is possible that some appropriate and related papers were removed in the search process.

According to the results of this paper, the requirement for more suitable algorithms exists to allocate tasks for resources in cloud environments. In addition, some principal rules in cloud scheduling should be re-evaluated to achieve maximum productivity and minimize wasted expense and effort. In this direction, to stay away from overloading and under loading of components and resources, the proposed method should execute workloads in an adaptable and scalable way. As the number of users increased in cloud environments, the number of tasks in the cloud that needed to be scheduled proportionally increased. Thus, an efficient mechanism is needed for scheduling tasks in these environments.

The general information gathered in this study makes the researchers acquainted with the state-of-the-art scheduling area of the cloud. Entirely, the answers to the research questions summarized the main objective of scheduling, current challenges, mechanisms and methods in the cloud systems. The authors hope that the results of this paper lead researchers to present more efficient scheduling techniques in cloud systems.

The purpose of this paper is cost optimization of project schedules under constrained resources and alternative production processes (APPs).

The model contains a cost objective function, generalized precedence relationship constraints, activity duration and start time constraints, lag/lead time constraints, execution mode (EM) constraints, project duration constraints, working time unit assignment constraints and resource constraints. The mixed-integer nonlinear programming (MINLP) superstructure of discrete solutions covers time–cost–resource options related to various EMs for project activities as well as variants for production process implementation.

The proposed model provides the exact optimal output data for project management, such as network diagrams, Gantt charts, histograms and S-curves. In contrast to classic scheduling approaches, here the optimal project structure is obtained as a model-endogenous decision. The project planner is thus enabled to achieve optimization of the production process simultaneously with resource-constrained scheduling of activities in discrete time units and at a minimum total cost.

A set of application examples are addressed on an actual construction project to display the advantages of proposed model.

The unique value this paper contributes to the body of knowledge reflects through the proposed MINLP model, which is capable of performing the exact cost optimization of production process (where presence and number of activities including their mutual relations are dealt as feasible alternatives, meaning not as fixed parameters) simultaneously with the associated resource-constrained project scheduling, whereby that is achieved within a uniform procedure.

A survey of project scheduling problems since 1973 limited to work done specifically in the project scheduling area (although several techniques developed for assembly line balancing and job‐shop scheduling can be applicable to project scheduling): the survey includes the work done on fundamental problems such as the resource‐constrained project scheduling problem (RCPSP); time/cost trade‐off problem (TCTP); and payment scheduling problem (PSP). Also discusses some recent research that integrates RCPSP with either TCTP or PSP, and PSP with TCTP. In spite of their practical relevance, very little work has been done on these combined problems to date. The future of the project scheduling literature appears to be developing in the direction of combining the fundamental problems and developing efficient exact and heuristic methods for the resulting problems.

Effective management of resources in a dynamic, multiproject environment requires consideration of two key issues: the availability of each of the multiple resources and the method of scheduling these resources to complete activities and, subsequently, projects. Identifies the trade‐offs between performance and the availability of multiple resources, when some resources are more costly than others. Finds that there are significant effects when the level of either the costly resources or the cheaper resources are varied, that trade‐offs can be made by reducing the availability of the costly resources and increasing the availability of the cheaper resources and that the improvement in completion time performance is reasonably linear over the tested ranges and the rates of improvement differ over the ranges. Describes the resource allocation factors and treatments as well as the scheduling heuristics. Uses a finite scheduling algorithm along with the prioritization heuristics to schedule the constrained multiple resources simultaneously and a simulation to replicate the environment. Develops linear regressions to provide further insight.

The purpose of this study is to verify that if applications categories are segmented and resources are allocated based on their specific category, how effective scheduling can be done?.

This paper proposes a scheduling framework for IoT application jobs, based upon the Quality of Service (QoS) parameters, which works at coarse grained level to select a fog environment and at fine grained level to select a fog node. Fog environment is chosen considering availability, physical distance, latency and throughput. At fine grained (node selection) level, a probability triad (C, M, G) is anticipated using Naïve Bayes algorithm which provides probability of newly submitted application job to fall in either of the categories Compute (C) intensive, Memory (M) intensive and GPU (G) intensive.

Experiment results showed that the proposed framework performed better than traditional cloud and fog computing paradigms.

The proposed framework combines types of applications and computation capabilities of Fog computing environment, which is not carried out to the best of knowledge of authors.