Pages that link to "Item:Q857333"

The following pages link to A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333):

Displaying 28 items.

• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
• Directed particle swarm optimization with Gaussian-process-based function forecasting (Q2239855) (← links)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study (Q2337384) (← links)
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
• A new heuristic algorithm for laser antimissile strategy optimization (Q2358875) (← links)
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan (Q2369202) (← links)
• A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems (Q2467429) (← links)
• A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan (Q2470219) (← links)
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
• Hidden Markov models training by a particle swarm optimization algorithm (Q2643715) (← links)
• Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
• Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem (Q2688574) (← links)
• Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach (Q2792241) (← links)
• A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems (Q2911576) (← links)
• Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA (Q3163227) (← links)
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES (Q3636499) (← links)
• Job shop scheduling optimization through multiple independent particle swarms (Q3639476) (← links)
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
• (Q5154491) (← links)
• A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources (Q6106766) (← links)
• Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak (Q6168128) (← links)
• The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)