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.
The market competition under globalization promotes enterprises to integrate resources all over the world, and the decision-making of outsourcing is becoming an important influencing factor of project scheduling. Taking subproject TCP/C1-3-1A-1 of Three Gorges Project for example, this paper constructs module network by design structure matrix, and chooses outsourcing module primarily by two levels,...
To provide best scheduling solution for the Shenzhou 8 space mission, the scheduling algorithms and configurations are determined before actual mission platform developing using a tryout architecture in Beijing Aerospace Control Center. The architecture is designed agile and extendable so that various processes can be implemented to validate and optimize the algorithms rapidly. With this architecture,...
Based on dynamic berth allocation problem (BAP) in container terminal (CT), a schedule reliability problem (SRP) optimization model is proposed. The model focuses on the minimum average schedule missed hours of ships between the ship schedule departure time and the actual departure time to enhance the schedule reliability (SR) of ships in CT, and the quay crane allocation is considered in this model...
This paper proposes a novel approach in tackling the resource brokering problem in heterogeneous distributed computing systems. To obtain the best utilization of the systems, researchers are often focusing on improving scheduling algorithms and strategies with the knowledge of tasks and resources at the scheduling time. Unlike these approaches, we apply an intelligence decision making mechanism to...
The diverse types of service beared on the large-scale IP network makes bandwidth allocation a research focus. This paper proposes a dynamic and fine-grained bandwidth allocation method which is suitable for large-scale network. We extends Norros' Fractional Brownian Motion (FBM) model to make it fit for the allocation of service bandwidth in IP network. Through identifying and analyzing different...
With the technical requirements for automated stereoscopic warehouse increasingly, the application of bend aisle stereoscopic warehouse is more and more extensive. Through taking the stereoscopic automated warehouse in Qinhuangdao as a research object, This paper describes the order picking path optimization and scheduling algorithm for bend aisle, solves the problem of a stacker's order picking in...
This paper is concerned with decentralized planning and scheduling where the information for decision making resides within local agents. When considering a decentralized approach, the goal is not primarily on achieving global optimality. For instance, [Greenstadt et al. 2006] studies the tradeoff in the Distributed Constraint Optimization (DCOP) problem on efficiency, privacy and optimality. In principle,...
Project contractors often need to rent resources to execute their projects, and the clients often set up bonus-penalty structure (BP-structure) at the deadline of the project to encourage the contractors in fulfilling the project on time. In this paper, we introduce BP-structure and flexible resource-constraints (i.e. resource renting) into traditional RCPSP, and formulate an optimization model of...
Tasks' scheduling has always been a central problem in the embedded real-time systems community. As in general the scheduling problem is NP-hard, researchers have been looking for efficient heuristics to solve the scheduling problem in polynomial time. One of the most important scheduling strategies is the Earliest Deadline First (EDF). It is known that EDF is optimal for uniprocessor platforms for...
Modular construction is common practice for building industrial plants in the Alberta oil sands region, Canada because of the savings in cost and schedule, and improving safety and quality. Each module represents a unique construction project. Thus, modular construction is considered as multi-project construction. Scheduling and effective allocation of resources (e.g., space, skilled crew, construction...
A novel approach to scheduling resolution by combining Autonomic Computing (AC), Multi-Agent Systems (MAS), Case-based Reasoning (CBR), and Bio-Inspired Optimization Techniques (BIT) will be described. AC has emerged as a paradigm aiming at incorporating applications with a management structure similar to the central nervous system. The main intentions are to improve resource utilization and service...
The logistics scheduling problem is the core problem of logistic management. In essence, the nature of ant colony algorithm is based on distributed collaborative optimization computing. Especially with the growing scale of the problem solving, parallel implementation of ant colony algorithm has great space to development. After comparing and analysing several classic logistic scheduling algorithms,...
Cancer treatment by chemotherapy involves multiple applications of toxic drugs over a period of time. Optimising the schedule of these treatments can improve the outcome for the patient. A schedule of treatment and its effect on the tumour can be simulated by a mathematical growth model. However, when used in conjunction with a black-box optimisation algorithm such as an Evolutionary Algorithm (EA)...
A Coevolutionary, Hyper Heuristic approach to the optimization of Three-dimensional Process Plant Layouts (3DPPLs) is explored. By taking advantage of the natural problem decomposition, one population of layout heuristics, and another population of scheduling heuristics are coevolved. Generalized heuristics are evolved by training on multiple small problem instances, so that training time is reduced...
An ant colony optimization approach for the satellite control resource scheduling problem is presented. Based on the observation that the solution space of the problem is sparse, two pheromone updating methods, i.e., the reinitialize-guidance-updating and current-guidance-updating methods, are proposed to avoid the trapping in local optima. The basic idea of these two methods is to change the distribution...
This paper focuses on the analysis of bus crew and vehicle scheduling under the management system commonly-seen in China. With considerations of management rules in practice and related regulations in China, this study proposes a bi-level multi-objective programming model for optimizing the crew and vehicle scheduling for the operation of public bus system. The developed model first estimates the...
Vehicle or bus scheduling problem (VSP), involving in a given set of time-tabled trips to be assigned to vehicles to minimize capital and operating costs, is one of the most critical issues faced by transit agencies. This paper addresses a multi-depot multi-vehicle-type VSP with route time constraints as well as capacity of depot restrictions, and presents a model with multiple objectives to minimize...
The study considers cash flow and proposes an profit optimization model for multi-project scheduling problems. The financial requirements of contractors working in a multiple project environment are addressed and investigated in this research. For model formulation, constraint programming (CP), which incorporates the techniques from mathematics, artificial intelligence, and operations research, is...
The problem of multi robot task allocation and scheduling is to assign more relative tasks to less relative robots and to scheme task processing sequence so as to minimize the processing time of these tasks. The key of this problem is to allocate proper quantity of tasks for each robot and schedule the optimal task sequence for each robot. In order to minimize the processing time for robots, an optimized...
At present, power management in High-Performance Computing (HPC) environment is becoming a hot topic owning to its high operation cost, low reliability and environmental impact. In this paper, we investigate energy minimization scheduling algorithm of data dependent tasks in DVS-Enabled cluster system. Considering the data-intensive characteristics, the proposed EOTD (Energy Optimization 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.