Pages that link to "Item:Q4302717"
From MaRDI portal
The following pages link to Genetic Algorithms and Random Keys for Sequencing and Optimization (Q4302717):
Displaying 50 items.
- A leader-follower partially observed, multiobjective Markov game (Q256610) (← links)
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite (Q319628) (← links)
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Minimising maximum response time (Q336510) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems (Q342533) (← links)
- GA topology optimization using random keys for tree encoding of structures (Q381347) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- Metaheuristics for assortment problems with multiple quality levels (Q976046) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
- A GA optimization model for workgroup-based repetitive scheduling (WoRSM) (Q1005604) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- Solving the response time variability problem by means of a genetic algorithm (Q1039773) (← links)
- Multicriteria inventory classification using a genetic algorithm (Q1291701) (← links)
- A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
- Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
