A united search particle swarm optimization algorithm for multiobjective scheduling problem
From MaRDI portal
Publication:611608
DOI10.1016/j.apm.2010.03.001zbMath1201.90081OpenAlexW2001209864MaRDI QIDQ611608
Publication date: 14 December 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.03.001
different due-datesmulti-objective schedulingparallel machines processesreverse order drawing GATTunited search
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Omni-channel product distribution network design by using the improved particle swarm optimization algorithm ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem ⋮ Memory and Learning in Metaheuristics
Uses Software
Cites Work
- WBMOAIS: A novel artificial immune system for multiobjective optimization
- Scheduling on parallel identical machines to minimize total tardiness
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- Parallel machine earliness and tardiness scheduling with proportional weights
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- An evolutionary artificial immune system for multi-objective optimization
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
- Genetic local search for multi-objective flowshop scheduling problems
- Modelling and heuristics of FMS scheduling with multiple objectives
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling