A biased random-key genetic algorithm for the minimization of open stacks problem
From MaRDI portal
Publication:2803254
DOI10.1111/ITOR.12109zbMATH Open1338.90338OpenAlexW2103937264MaRDI QIDQ2803254FDOQ2803254
Authors: José Fernando Gonçalves, Miguel Dias Costa, Mauricio G. C. Resende 
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5384
Recommendations
- scientific article; zbMATH DE number 2014735
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- A biased random-key genetic algorithm for the unequal area facility layout problem
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Biased random-key genetic algorithms with applications in telecommunications
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A genetic algorithm for the resource constrained multi-project scheduling problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A hybrid genetic algorithm for the job shop scheduling problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Applications of modern heuristic search methods to pattern sequencing problems
- Randomized heuristics for the family traveling salesperson problem
- Dynamic programming to minimize the maximum number of open stacks
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
- Title not available (Why is that?)
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Improved heuristics for sequencing cutting patterns
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- Heuristics for sequencing cutting patterns
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Heuristic and exact methods for the cutting sequencing problem
- A multiple-population evolutionary approach to gate matrix layout
Cited In (14)
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Solving the set packing problem via a maximum weighted independent set heuristic
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
- A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure
- Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- Title not available (Why is that?)
- The capacitated family traveling salesperson problem
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
- Mathematical models for the minimization of open stacks problem
- Efficient approaches for the flooding problem on graphs
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
This page was built for publication: A biased random-key genetic algorithm for the minimization of open stacks problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803254)
