Job shop scheduling optimization through multiple independent particle swarms

DOI10.1108/17563780910939237zbMath1183.68118MaRDI QIDQ3639476

Brian Ivers, Gary G. Yen

Publication date: 30 October 2009

Published in: International Journal of Intelligent Computing and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/17563780910939237

zbMATH Keywords

production scheduling; job sequence loading

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, An effective new island model genetic algorithm for job shop scheduling problem

Cites Work

• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• General local search methods
• Deterministic job-shop scheduling: Past, present and future
• A generalized permutation approach to job shop scheduling with genetic algorithms
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• Algorithms for Solving Production-Scheduling Problems