Genetic Algorithms and Random Keys for Sequencing and Optimization
From MaRDI portal
Publication:4302717
DOI10.1287/ijoc.6.2.154zbMath0807.90060OpenAlexW2168079536MaRDI QIDQ4302717
Publication date: 21 August 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.2.154
resource allocationquadratic assignmentsequencinggenetic algorithmrandom keysmultiple machine schedulingrobust representation technique
Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Genetics and epigenetics (92D10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (only showing first 100 items - show all)
A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions ⋮ RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ 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 ⋮ A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing ⋮ 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 ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ A two-phase multi-objective metaheuristic for a green UAV grid routing problem ⋮ Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery ⋮ Model and methods to address urban road network problems with disruptions ⋮ A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours ⋮ A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ Program trace optimization with constructive heuristics for combinatorial problems ⋮ A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ The capacitated family traveling salesperson problem ⋮ 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 genetic algorithm for solving the economic lot scheduling problem in flow shops ⋮ A biased random-key genetic algorithm for data clustering ⋮ USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs ⋮ An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems ⋮ Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A genetic algorithm for the resource constrained multi-project scheduling problem ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Improved heuristics for the regenerator location problem ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ An approach to determine storage locations of containers at seaport terminals ⋮ Heuristic solutions for general concave minimum cost network flow problems ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ A genetic algorithm methodology for complex scheduling problems ⋮ Using a hybrid of exact and genetic algorithms to design survivable networks ⋮ 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 new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ 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 PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES ⋮ Randomized heuristics for the family traveling salesperson problem ⋮ A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM ⋮ Differential Evolution for Permutation—Based Combinatorial Problems ⋮ Discrete/Binary Approach ⋮ Optimization of OSPF Routing in IP Networks ⋮ Simulated annealing and genetic algorithms for scheduling products with multi-level product structure ⋮ Survivable IP network design with OSPF routing ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem ⋮ A continuous approach to considering uncertainty in facility design ⋮ Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction ⋮ A genetic algorithm applied to optimal allocation in stratified sampling ⋮ A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure ⋮ Scheduling flexible flow lines with sequence-dependent setup times ⋮ A hybrid biased random key genetic algorithm for the quadratic assignment problem ⋮ Solving composite scheduling problems using the hybrid genetic algorithm ⋮ Hybrid genetic algorithm for optimization problems with permutation property ⋮ 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 ⋮ A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks ⋮ Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art ⋮ 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 ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ Minimising maximum response time ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ 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 ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Hybrid method with CS and BRKGA applied to the minimization of tool switches problem ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ Metaheuristics: A bibliography ⋮ A biased random-key genetic algorithm for road congestion minimization ⋮ A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families ⋮ GA topology optimization using random keys for tree encoding of structures ⋮ Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach ⋮ Nature inspired genetic algorithms for hard packing problems ⋮ Competent genetic algorithms for weighing matrices
This page was built for publication: Genetic Algorithms and Random Keys for Sequencing and Optimization
