A new hybrid multi-objective Pareto archive PSO algorithm for a classic job shop scheduling problem with ready times

DOI10.1007/978-3-642-14831-6_9MaRDI QIDQ3053333zbMATHOpenAlexFDO

Authors R. Tavakkoli-Moghaddam, Mojgan Azarkish, Azar Sadeghnejad

Publication date 28 October 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14831-6_9

zbMATH Keywords

genetic operatorsVNSmulti-objective job shopPareto archive PSO

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Hybrid Pareto-based particle swarm optimization for multi-objective flexible job shop scheduling problems
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• Hybrid particle-swarm optimization for the multi-objective flexible job-shop scheduling problem
• Particle swarm optimization based multi-objective job shop scheduling
• A multi-objective particle swarm for a flow shop scheduling problem

Cited in

(4)

• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• A hybrid evolutionary algorithm for bi-objective job shop scheduling problems
• Providing an Integrated Multi-Objective Model for Closed-Loop Supply Chain under Fuzzy Conditions with Upgral Approach
• A hybrid differential evolution and tree search algorithm for the job shop scheduling problem

This page was built for publication: A new hybrid multi-objective Pareto archive PSO algorithm for a classic job shop scheduling problem with ready times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053333)