Pages that link to "Item:Q2475842"

The following pages link to A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842):

Displaying 50 items.

• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
• Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
• A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow (Q614060) (← links)
• Meta-heuristic algorithms for solving a fuzzy single-period problem (Q652851) (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
• A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
• Predictive-reactive scheduling for single surgical suite subject to random emergency surgery (Q887886) (← links)
• Shrinking hypersphere based trajectory of particles in PSO (Q902500) (← links)
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507) (← links)
• Identification of surgical practice patterns using evolutionary cluster analysis (Q969939) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
• An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem (Q1048304) (← links)
• Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem (Q1639843) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• An asynchronous parallel disassembly planning based on genetic algorithm (Q1750479) (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) (← links)
• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics (Q1762143) (← links)
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
• MDPCluster: a swarm-based community detection algorithm in large-scale graphs (Q1987200) (← links)
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization (Q1991849) (← links)
• Novel self-adjusted particle swarm optimization algorithm for feature selection (Q2047517) (← links)
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
• Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
• Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan (Q2256367) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• Strategic timetable scheduling for last trains in urban railway transit networks (Q2290115) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
• A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem (Q2688574) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems (Q2911576) (← links)
• Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
• HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS (Q2998846) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• A novel discrete particle swarm optimization algorithm for solving bayesian network structures learning problem (Q5031758) (← links)
• Multi-objective feasibility enhanced particle swarm optimization (Q5058820) (← links)
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
• (Q5154491) (← links)