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_9zbMath1202.68075OpenAlexW1843408111MaRDI QIDQ3053333

Azar Sadeghnejad, Reza Tavakkoli-Moghaddam, Mojgan Azarkish

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

VNSgenetic operatorsmulti-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)

Related Items (2)

A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ Providing an Integrated Multi-Objective Model for Closed-Loop Supply Chain under Fuzzy Conditions with Upgral Approach

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