A new particle swarm optimization for multi-objective open shop scheduling

DOI10.1080/02522667.2011.10700119zbMath1244.90247OpenAlexW1998823279MaRDI QIDQ2903242

No author found.

Publication date: 8 August 2012

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1268506H_03_JIOS_T098_32-6_pp1269-1287a.pdf

zbMATH Keywords

open shopmulti-objectiveparticle swarm

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

A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports

Cites Work

• Scheduling preemptive open shops to minimize total tardiness
• A new heuristic for open shop total completion time problem
• A tabu search algorithm for the open shop scheduling problem
• Competitive genetic algorithms for the open-shop scheduling problem
• Open shop scheduling problems with late work criteria.
• A hybrid genetic algorithm for the open shop scheduling problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A new lower bound for the open-shop problem
• A new particle swarm optimization for the open shop scheduling problem
• Open Shop Scheduling to Minimize Finish Time
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: A new particle swarm optimization for multi-objective open shop scheduling