Genetic Algorithms and Random Keys for Sequencing and Optimization
From MaRDI portal
genetic algorithmmultiple machine schedulingquadratic assignmentrandom keysresource allocationrobust representation techniquesequencing
Learning and adaptive systems in artificial intelligence (68T05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Quadratic programming (90C20) Combinatorial optimization (90C27) Genetics and epigenetics (92D10)
Recommendations
Cited in
(only showing first 100 items - show all)- Order acceptance using genetic algorithms
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- A GA optimization model for workgroup-based repetitive scheduling (WoRSM)
- A genetic algorithm for the proportionate multiprocessor open shop
- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- The single-machine total tardiness scheduling problem: review and extensions
- Solving the response time variability problem by means of a genetic algorithm
- Multicriteria inventory classification using a genetic algorithm
- A hybrid genetic/optimization algorithm for a task allocation problem
- Iterative improvement methods for a multiperiod network design problem
- A sequential sampling procedure for genetic algorithms
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Resource-constrained project scheduling: A critical activity reordering heuristic
- Permutation genetic algorithm for stacking sequence design of composite laminates
- A greedy genetic algorithm for the quadratic assignment problem
- Solving composite scheduling problems using the hybrid genetic algorithm
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- A two-machine flowshop scheduling problem with precedence constraint on two jobs
- Diversity controlling genetic algorithm for order acceptance and scheduling problem
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
- A global search framework for practical three-dimensional packing with variable carton orientations
- Efficient solutions for the far from most string problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Inequality constraint handling in genetic algorithms using a boundary simulation method
- Solving a two-agent single-machine scheduling problem considering learning effect
- A tabu search algorithm for parallel machine total tardiness problem
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Evolving cellular automata to perform computations: Mechanisms and impediments
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Scheduling flexible flow lines with sequence-dependent setup times
- Hybrid genetic algorithm for optimization problems with permutation property
- Metaheuristics: A bibliography
- Competent genetic algorithms for weighing matrices
- Biased random-key genetic algorithms with applications in telecommunications
- Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- A comparison of genetic representations for multi-objective shortest path problems on multigraphs
- A parallel variable neighborhood search for solving covering salesman problem
- A survey of scheduling with parallel batch (p-batch) processing
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks
- A two-phase approach for single container loading with weakly heterogeneous boxes
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- An efficient evolutionary algorithm for the ring star problem
- Local search-based hybrid algorithms for finding Golomb rulers
- Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives
- A genetic algorithm approach to a nurse rerostering problem
- A biased random-key genetic algorithm for data clustering
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- A genetic algorithm for the resource constrained multi-project scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
- A leader-follower partially observed, multiobjective Markov game
- A continuous approach to considering uncertainty in facility design
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- DILS: constrained clustering through dual iterative local search
- A comparative study of solution representations for the unrelated machines environment
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- Slot machines RTP optimization with genetic algorithms
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- A differential evolution algorithm for the winner determination problem in combinatorial auctions
- A single-machine two-agent scheduling problem by GA approach
- Applications of meta-heuristics to traffic engineering in IP networks
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A biased random-key genetic algorithm for the unequal area facility layout problem
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
- Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing
- Minimising maximum response time
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- Optimization of OSPF routing in IP networks
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Survivable IP network design with OSPF routing
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
This page was built for publication: Genetic Algorithms and Random Keys for Sequencing and Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302717)
