Loading [MathJax]/extensions/MathMenu.js
IEEE Xplore Search Results

Showing 1-25 of 34,766 resultsfor

Filter Results

Show

Results

This paper presents an improved bacterial foraging algorithm (IBFA) to find the optimal short-term hydro-thermal generation scheduling (STHTS). The STHTS problem is a dynamic large-scale nonlinear optimization problem which requires solving the unit commitment and economic power load dispatch problems. The bacterial foraging algorithm (BFA) is a recently developed evolutionary optimization techniq...Show More
This paper presents heuristic algorithms for solving the three-way joint optimization of Performance, Energy and temperature (PET) in scheduling tasks to multi-core processors. The problem, called as PET optimized scheduling (PETOS) problem is a high-complexity problem due to conflicting objectives. While solutions to the PETOS problem can be obtained by using conventional multi-objective optimiza...Show More

Distributed scheduling problems in intelligent manufacturing systems

;;;;;

Tsinghua Science and Technology
Year: 2021 | Volume: 26, Issue: 5 | Journal Article |
Cited by: Papers (122)
Currently, manufacturing enterprises face increasingly fierce market competition due to the various demands of customers and the rapid development of economic globalization. Hence, they have to extend their production mode into distributed environments and establish multiple factories in various geographical locations. Nowadays, distributed manufacturing systems have been widely adopted in industr...Show More

Distributed scheduling problems in intelligent manufacturing systems

;;;;;

Year: 2021 | Volume: 26, Issue: 5 | Journal Article |
The rapid development of cloud computing technology has spawned a plethora of complex applications, leading to an increasing demand for efficient task scheduling algorithms. Traditional task scheduling algorithms have certain limitations in resource allocation and load balancing, making it difficult to fully adapt to the dynamic and evolving cloud computing environment. In order to enhance the eff...Show More
The single particle swarm algorithm exhibits deficiencies in optimality, diversity, and convergence speed when addressing the multi-objective optimal scheduling problem in flexible job shops. In this research, we introduce a multi-objective Pareto quantum particle swarm algorithm. To aviod the algorithm falling into the problem of local convergence, three initialization strategies are proposed to ...Show More
Multisensor scheduling, a multi-objective optimization problem, simultaneously aims to find the optimal matching between sensors and targets in a certain period, that is, to generate the optimal multisensor scheduling scheme. Several sensor scheduling literatures proposed multisensor scheduling schemes incorporating various algorithms, but the majority of them dealt with sensors to targets in two ...Show More
In order to solve the resource management challenge of cloud service center when the user demand peaks periodically, reduce resource waste and energy consumption, improve resource utilization and system performance, a scheduling algorithm based on multi-objective optimization is proposed in this paper. Firstly, this paper analyzes the main problems of current cloud computing resource scheduling, c...Show More
Grid Computing is a form of distributed computing environment that allows sharing, selection and coordinated use of diverse resources owned by different organizations. Effective and efficient scheduling of resources in grid is fundamentally important. To optimize the scheduling of tasks to suitable resources in computational grids, a Multi Criterion Ant Colony Optimization (MCACO) Algorithm is pro...Show More
This paper addresses the Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks (EADHFSPMT) by considering two objectives simultaneously, i.e., makespan and total energy consumption. It consists of three sub-problems, i.e., job assignment between factories, job sequence in each factory, and machine allocation for each job. We present a mixed inter linear programming...Show More

Optimal Utility-Based Multi-User Scheduling and Low-Complexity Alternatives

;;;

In this work the problem of utility-based multiuser scheduling is considered in a fading environment. The goal is to make use of the multi-user diversity while still guaranteeing short-term fairness. The performance of a scheduler is captured by a utility function. Based on the utility function and assuming statistical knowledge of the time-varying channel the optimization problem for the optimal ...Show More

Optimal Utility-Based Multi-User Scheduling and Low-Complexity Alternatives

;;;

The task scheduling policy is the important factors for achieving efficient calculation in a cloud computing environment. This article put forwards a task scheduling method based on improved particle swarm algorithm against the present inefficiency. Particle Swarm Optimization (PSO) algorithm is used to solve task scheduling optimization by introducing the iterative selection operator. Improved pa...Show More
For the job shop on-line scheduling in which the release dates of jobs are stochastic distributed, the hybrid scheduling strategy that integrates the interval rolling mechanism with the key event-driven is introduced. The satisfactory solution can be obtained through iterative optimization by embedding the neighborhood search into the constraint satisfaction solving procedure. The simulation and c...Show More
Faced with increasing growth of container throughput and more large ships, it is necessary to improve efficiency of container terminals. This paper applies simulation and optimization technology to mimic and optimize equipment scheduling tasks in container terminals. Firstly, we propose a two-layer embedded framework, which can avoid the separation of simulation and optimization. In addition, we a...Show More
There have been several studies on the scheduling mechanism in cloud manufacture in on-factory manufacturing situations. However, scheduling mechanism in cloud manufacture in an off-factory situation (field cloud manufacturing) has not been widely studied. Even though there are many manufacturing tasks that need to be implemented using field manufacturing scheme. So in this study, a research on sc...Show More
The article presents a study of the Particle Swarm optimization method for scheduling problem. To improve the method's performance a restriction of particles' velocity and an evolutionary meta-optimization were realized. The approach proposed uses the Genetic algorithms for selection of the parameters of Particle Swarm optimization. Experiments were carried out on test tasks of the job-shop schedu...Show More
Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the limited resources in the satellite earth station system, the rationality of resource allocation directly affects the overall performance of the multi-satellite system. The resource sched...Show More
A discrete multi-objective particle swarm optimization (DMOPSO) algorithm is proposed in this paper. The algorithm adopts two different discretized strategies: directly rounding and redefining based on multi-objective particle swarm optimization with crowding distance (MOPSO_CD) and according to the characteristic of discrete variable. The crowding distance mechanism together with a mutation opera...Show More
This work investigates the use of bio-inspired algorithms in real-time task scheduling, whereby their capabilities are explored in intelligent computing to enhance performance optimization. Three influential bio-inspired algorithms, including Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Grey Wolf Optimization (GWO), are employed in the real-time task scheduling process. Th...Show More
In order to make the embedded cloud computing resources to achieve efficient and real-time task scheduling, this paper puts forward a method of resource scheduling that task completion time and resource load balancing degree as the objective function and using multi-objective particle swarm optimization algorithm to optimize the task scheduling. Simulation results verify the effectiveness of the a...Show More
This paper presents a hybrid particle swarm optimization algorithm (HPSO) for solving the bi-criteria flexible job shop scheduling problem. Two minimization objectives- the maximum completion time (makespan) and the total workload of all machines are considered simultaneously. In this study, a novel discrete particle swarm optimization (PSO) algorithm was proposed, which incorporates well-designed...Show More
Job shop scheduling has been an active area of research for several decades. However, there seems to have been a significant gap between the theoretical research in academia and practical application in industry. The scheduling system, which are developed aiming at the vast library of benchmark problems, usually faces some challenges when applying in the real manufacturing environment to support t...Show More
To address the challenging Multi-Mode Resource-Constrained Multi-Project Scheduling Problem (MRCMPSP) that involves scheduling multiple instances of projects with various execution modes, subject to resource constraints and precedence relations, this paper proposes the Delay Parallel Decoupled Schedule Generation Scheme (DPDSGS) and the Dynamic-Cluster Dynamic-Weight Multi-Objective Particle Swarm...Show More

Reactive scheduling of multiple EOSs under cloud uncertainties: Model and algorithms

;;

Journal of Systems Engineering and Electronics
Year: 2021 | Volume: 32, Issue: 1 | Journal Article |
Cited by: Papers (7)
Most earth observation satellites (EOSs) are low-orbit satellites equipped with optical sensors that cannot see through clouds. Hence, cloud coverage, high dynamics, and cloud uncertainties are important issues in the scheduling of EOSs. The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed. ...Show More

Reactive scheduling of multiple EOSs under cloud uncertainties: Model and algorithms

;;

Year: 2021 | Volume: 32, Issue: 1 | Journal Article |
In this paper, we present an ant colony optimization algorithm for solving the Job-shop Scheduling Problem (JSSP). Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ants, which is also used to solve this combinatorial optimization problem. In JSSP ants move from one machine (nest) to another machine (food source) depending upon the job flow, thereby optimizing t...Show More
RCPSP(Resource-constrained Project Scheduling Problem) that has been proved to be a NP-hard problem is a kind of combination optimization problem. With the problem scale becoming larger and larger, the problem will become more difficult to solve. A discussion mechanism based on brain storm optimization (DMBSO) for the RCPSP was presented. According to the characteristics of the RCPSP and the probl...Show More