Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time
From MaRDI portal
Publication:2378748
DOI10.1016/j.amc.2008.05.086zbMath1175.90187MaRDI QIDQ2378748
Xingsheng Gu, Bin Jiao, Qun Niu
Publication date: 14 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.05.086
fuzzy sets; job shop scheduling; makespan; genetic algorithm; processing time; particle swarm optimization (PSO)
90C30: Nonlinear programming
90B35: Deterministic scheduling theory in operations research
03E72: Theory of fuzzy sets, etc.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
- Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems
- Job sequencing with fuzzy processing times
- Ranking fuzzy numbers in the setting of possibility theory
- Ranking fuzzy numbers with maximizing set and minimizing set
- Comparison of fuzzy numbers based on the probability measure of fuzzy events
- A procedure for ordering fuzzy subsets of the unit interval
- Genetic algorithms and traveling salesman problems
- Real-time task scheduling with fuzzy deadlines and processing times
- Scheduling under fuzziness
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Fuzzy sets
- Outline for a Logical Theory of Adaptive Systems