A new particle swarm optimization for the open shop scheduling problem

DOI10.1016/j.cor.2007.02.019zbMath1133.90017MaRDI QIDQ2482375

David Y. Sha, Cheng-Yu Hsu

Publication date: 16 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.019

zbMATH Keywords

open shop scheduling; particle swarm optimization

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A contribution and new heuristics for open shop scheduling

Uses Software

• Beam-ACO

Cites Work

• Unnamed Item
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Classical and new heuristics for the open-shop problem: A computational evaluation
• A tabu search algorithm for the open shop scheduling problem
• A branch \(\&\) bound algorithm for the open-shop problem
• A tabu search algorithm for the open shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• 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
• Benchmarks for basic scheduling problems
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• A hybrid genetic algorithm for the job shop scheduling problem
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Open Shop Scheduling to Minimize Finish Time
• Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
• Algorithms for Solving Production-Scheduling Problems
• Solving the open shop scheduling problem