Pages that link to "Item:Q2484343"
From MaRDI portal
The following pages link to A hybrid genetic algorithm for the job shop scheduling problem (Q2484343):
Displayed 43 items.
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- An object-coding genetic algorithm for integrated process planning and scheduling (Q319374) (← links)
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- A multi-layer line search method to improve the initialization of optimization algorithms (Q320070) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems (Q1665003) (← links)
- Cultural-based genetic tabu algorithm for multiobjective job shop scheduling (Q1717896) (← links)
- An asynchronous parallel disassembly planning based on genetic algorithm (Q1750479) (← links)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net (Q1760793) (← links)
- A new hybrid genetic algorithm for job shop scheduling problem (Q1761165) (← links)
- A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
- Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding (Q2311187) (← links)
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
- Selection of discriminant mid-infrared wavenumbers by combining a naïve Bayesian classifier and a genetic algorithm: application to the evaluation of lignocellulosic biomass biodegradation (Q2408710) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- A genetic algorithm for the resource constrained multi-project scheduling problem (Q2482793) (← links)
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
- A scatter search approach to sequence-dependent setup times job shop scheduling (Q3055324) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)