Application of Adaptive Particle Swarm Optimization to Bi-level Job-Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Discrete Particle Swarm Optimization Algorithm for Job-shop Scheduling Problem to Maximizing Production
This paper researches on a special job-shop scheduling problem meeting capabilities of equipments and different due-dates. Its model is developed, which can accord process capacity and different due-dates in numerous jobs to select some to process, and the objective is as far as possible to maximize output. In order to solve complex scheduling problems proposed in this paper, a discrete particl...
متن کاملApplication of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملResearch on Job-shop Scheduling Problem Based on Improved Particle Swarm Optimization
Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...
متن کاملMulti-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization
Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) ...
متن کاملHybrid Multi-Objective Particle Swarm Optimization for Flexible Job Shop Scheduling Problem
Hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated annealing (SA) is proposed, to solve Flexible Job Shop Scheduling with five objectives to be minimized simultaneously: makespan, maximal machine workload, total workload, machine idle time & total tardiness. Rescheduling strategy used to shuffle workload once the machine breakdown takes place in proposed algorithm. The hy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2014
ISSN: 1598-7248
DOI: 10.7232/iems.2014.13.1.043