An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem

DOI10.1016/J.COR.2013.11.019zbMath1348.90337OpenAlexW1991791873MaRDI QIDQ336962

Fuqing Zhao, Jonrinaldi, Jianxin Tang, Jun-Biao 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

zbMATH Keywords

particle swarm optimizationadaptive meta-Lamarckian strategydecline disturbanceexpanded job shop scheduling problemmulti-objective job shop scheduling problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms ⋮ A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues

Cites Work

• Unnamed Item
• 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
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• 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 new heuristic for the n-job, M-machine flow-shop problem
• A memetic algorithm for the job-shop with time-lags
• Genetic local search for multi-objective flowshop scheduling problems
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling 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
• Job shop scheduling optimization through multiple independent particle swarms
• Scheduling with Multiple Performance Measures: The One-Machine Case
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• 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 <scp>P</scp>etri Nets
• A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models

This page was built for publication: An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem