An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
DOI10.1016/J.COR.2013.11.019zbMATH Open1348.90337OpenAlexW1991791873MaRDI QIDQ336962FDOQ336962
Authors: Fuqing Zhao, Jianxin Tang, Jonrinaldi, Junbiao Wang 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.019
Recommendations
- Applications of discrete particle swarm optimization in solving the job-shop scheduling problems
- Job-shop scheduling based on improved particle swarm
- Particle swarm optimization based multi-objective job shop scheduling
- A hybrid particle swarm optimization algorithm for job-shop scheduling problem
- A particle swarm optimization algorithm for job-shop scheduling problem
particle swarm optimizationadaptive meta-Lamarckian strategydecline disturbanceexpanded job shop scheduling problemmulti-objective job shop scheduling problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A new heuristic for the n-job, M-machine flow-shop problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Evolving better population distribution and exploration in evolutionary multi-objective optimization
- On operators and search space topology in multi-objective flow shop scheduling
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Solving a bicriterion scheduling problem
- Heuristics for scheduling in flowshop with multiple objectives
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A memetic algorithm for the job-shop with time-lags
- Genetic local search for multi-objective flowshop scheduling problems
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- Job shop scheduling optimization through multiple independent particle swarms
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Title not available (Why is that?)
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Bicriterion scheduling in the two-machine flowshop
- Job shop scheduling considering material handling
- Quantized tracking control for a multi-agent system with high-order leader dynamics
- A polynomial algorithm for computing elementary siphons in a class of Petri nets
- A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
Cited In (2)
This page was built for publication: An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336962)
