A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
From MaRDI portal
Publication:3636499
DOI10.1142/S0217595909002158zbMath1168.90466OpenAlexW2080752052MaRDI QIDQ3636499
Voratas Kachitvichyanukul, Pisut Pongchairerks
Publication date: 30 June 2009
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595909002158
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A multi-objective bi-level location planning problem for stone industrial parks ⋮ Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective ⋮ Analysis of the similarities and differences of job-based scheduling problems ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem ⋮ A Taxonomy for the Flexible Job Shop Scheduling Problem
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Job-shop scheduling with multi-purpose machines
- Stability of an optimal schedule
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Complexity of scheduling problems with multi-purpose machines
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
