A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS
International Journal of Computational MethodsPublished 1 September 2005
Hongwei Ge, Yanchun Liang, Yuan Zhou, Xiangyi Guo
Citations30
SJR quartileQ2
SJR score0.41
SNIP0.64
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A novel particle swarm optimization (PSO)-based algorithm is developed for job-shop scheduling problems (JSSP), which are the most general and difficult issues in traditional scheduling problems.
Abstract
A novel particle swarm optimization (PSO)-based algorithm is developed for job-shop scheduling problems (JSSP), which are the most general and difficult issues in traditional scheduling problems. Our goal is to develop an efficient algorithm based on swarm intelligence for the JSSP. Thereafter a novel concept for the distance and velocity of particles in the PSO is proposed and introduced to pave the way for the JSSP. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing systems, with simulation results showing the possibilities of high quality solutions for typical benchmark problems.
Keywords
Computer ScienceEngineering
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
A modified particle swarm optimizer
10,157 Citations2002Yibing Shi, R.C. Eberhart
A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Evolutionary ComputationProduction Scheduling and Rescheduling with Genetic Algorithms
295 Citations1999Christian Bierwirth, Dirk C. Mattfeld
A Genetic Algorithm is presented which solves the job shop scheduling problem and a highly efficient decoding procedure is proposed which strongly improves the quality of schedules.
Computers & Industrial EngineeringA hybrid genetic algorithm for the job shop scheduling problems
240 Citations2003Byung‐Joo Park, Hyung Rim Choi +1 more
The goal of this research is to develop an efficient scheduling method based on genetics algorithm to address JSSP, and the proposed approach yields significant improvement in solution quality.
European Journal of Operational ResearchA tabu search method guided by shifting bottleneck for the job shop scheduling problem
208 Citations2000Ferdinando Pezzella, Emanuela Merelli
The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions.
European Journal of Operational ResearchSome new results on simulated annealing applied to the job shop scheduling problem
201 Citations1999Michael Kolonko
A new approach is presented that uses a small population of SA runs in a genetic algorithm (GA) framework and yields excellent results on the classical test examples of the JSP.
European Journal of Operational ResearchAn efficient genetic algorithm for job shop scheduling with tardiness objectives
176 Citations2003Dirk C. Mattfeld, Christian Bierwirth
It is shown that a heuristic reduction of the search space can help the algorithm to find better solutions in a shorter computation time.
European Journal of Operational ResearchA branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
129 Citations2002Roland Heilmann
European Journal of Operational ResearchBidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects
113 Citations2000Robert Klein
A comprehensive numerical investigation shows that the performance of such heuristics is considerably increased in particular when using the bidirectional planning, which indicates that such strategies should also be applied within meta heuristic-based procedures.
Artificial IntelligenceProblem difficulty for tabu search in job-shop scheduling
102 Citations2003Jean‐Paul Watson, J. Christopher Beck +2 more
A model of problem difficulty for tabu search in the JSP is developed, borrowing from similar models developed for SAT and other NP-complete problems, and it is shown that the mean distance between random local optima and the nearest optimal solution is highly correlated with the cost of locating optimal solutions to typical, random JSPs.
Computers & Industrial EngineeringThe hybrid heuristic genetic algorithm for job shop scheduling
100 Citations2001Hong Zhou, Feng Yuncheng +1 more
A kind of hybrid heuristic GA is proposed for problem n/m/G/Cmax, where the scheduling rules are integrated into the process of genetic evolution and the neighborhood search technique is adopted as an auxiliary procedure to improve the solution performance.
Mathematical Methods of Operations ResearchA branch-and-bound algorithm for the resource-constrained project scheduling problem
80 Citations2000Ulrich Dorndorf, Erwin Pesch +1 more
A time-oriented branch-and-bound algorithm for the resource-constrained project scheduling problem which explores the set of active schedules by enumerating possible activity start times using constraint-propagation techniques that exploit the temporal and resource constraints of the problem in order to reduce the search space.
Advanced Engineering InformaticsArtificial neural networks for job shop simulation
78 Citations2002Daniel J. Fonseca, Daniel Navaresse
The ANN-based simulations were able to fairly capture the underlying relationship between jobs' machine sequences and their resulting average flowtimes, which proves that ANNs are a viable tool for stochastic simulation metamodeling.
Journal of Intelligent ManufacturingThe strategies and parameters of tabu search for job-shop scheduling
72 Citations2004Faruk Geyik, İsmail Hakkı Cedi̇moğlu
This paper focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration for the job-shop scheduling problem.
Computers & Industrial EngineeringNeural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling
69 Citations2001Haibin Yu, Wei Liang
A hybrid approach involving neural networks and genetic algorithm (GA) is presented to solve the expanded job-shop scheduling problem (EJSSP) and it is shown that the hybrid approach is powerful for complex EJSSP.
Computers & Operations ResearchA new adaptive neural network and heuristics hybrid approach for job-shop scheduling
66 Citations2001Shengxiang Yang, Dingwei Wang
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented, which is of high speed and efficiency and can be combined with the neural network.
The International Journal of Advanced Manufacturing TechnologyA robust simulated annealing heuristic for flow shop scheduling problems
51 Citations2004Chinyao Low, Jinn‐Yi Yeh +1 more
Computational experiments show that simulated annealing with a designed mechanism can make the solution quality more robust than it is without the mechanism, and the proposed simulatedAnnealing procedure performs well with respect to solution and efficiency.
European Journal of Operational ResearchThe two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
50 Citations2003Can Akkan, Selçuk Karabatı
The main feature of the branch-and-bound algorithm is a new lower bounding scheme that is based on a network formulation of the problem that can solve problems with up to 60 jobs and uniformly distributed in the [1,10] ([1,100]) range.
Journal of Intelligent ManufacturingFuzzy priority rule for job shop scheduling
46 Citations2004Yavuz Burak Canbolat, Emin Gündoğar
A new approach using fuzzy logic is introduced to combine SPT, CR priority rules, and next machine's load (NML) rate the job to be processed next in order to satisfy not only a single objective but also all objectives.
International Journal of Systems ScienceA revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
28 Citations2000Tai-Yue Wang, Kuei-Bin Wu
This paper applies a revised configuration generation mechanism of the Simulated Annealing (SA) algorithm to obtain the minimum total tardiness in job shop scheduling problems and indicates that the solution quality of the SA approaches outperform MEHA.
Journal of Manufacturing SystemsAn efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
27 Citations2001Wei‐Chang Yeh