Pages that link to "Item:Q878589"
From MaRDI portal
The following pages link to A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589):
Displaying 36 items.
- A particle swarm optimization approach with refinement procedure for nurse rostering problem (Q337337) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm (Q523563) (← links)
- A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow (Q614060) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Shrinking hypersphere based trajectory of particles in PSO (Q902500) (← links)
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507) (← links)
- Introducing dynamic diversity into a discrete particle swarm optimization (Q955627) (← links)
- The reliable design of one-piece flow production system using fuzzy ant colony optimization (Q959512) (← links)
- Identification of surgical practice patterns using evolutionary cluster analysis (Q969939) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Particle swarm optimization applied to the design of water supply systems (Q1004739) (← links)
- Design optimization of wastewater collection networks by PSO (Q1004740) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem (Q1048304) (← links)
- Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem (Q1639843) (← links)
- An improved multiobjective PSO for the scheduling problem of panel block construction (Q1727458) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Convergence proof of an enhanced particle swarm optimisation method integrated with evolutionary game theory (Q1991889) (← links)
- A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm (Q2257339) (← links)
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
- A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems (Q2467429) (← links)
- Modeling and solution of the joint quay crane and truck scheduling problem (Q2514750) (← links)
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment (Q3163305) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES (Q3636499) (← links)
- Scheduling of multiple in-line steppers for semiconductor wafer fabs (Q5172568) (← links)
- Recent advances in dynamic facility layout research (Q5882275) (← links)
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
