An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
From MaRDI portal
Publication:5416771
DOI10.1111/itor.12044zbMath1291.90093OpenAlexW2131113792MaRDI QIDQ5416771
José Fernando Gonçalves, Mauricio G. C. Resende
Publication date: 15 May 2014
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5392
heuristicsschedulinggenetic algorithmjob-shopbiased random-key genetic algorithmrandom keysgraphical approach
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A biased random-key genetic algorithm for the unequal area facility layout problem, A tabu search/path relinking algorithm to solve the job shop scheduling problem, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, A neighborhood for complex job shop scheduling problems with regular objectives, Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem, Improved heuristics for the regenerator location problem, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A biased random-key genetic algorithm for the Steiner triple covering problem
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A random key based genetic algorithm for the resource constrained project scheduling problem
- An efficient algorithm for the job-shop problem with two jobs
- The job shop scheduling problem: Conventional and new solution techniques
- A branch and bound algorithm for the job-shop scheduling problem
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Scheduling the General Job-Shop
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Job-Shop Scheduling by Implicit Enumeration
- Computational Complexity of Discrete Optimization Problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Short Shop Schedules
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- Algorithms for Solving Production-Scheduling Problems
- Job Shop Scheduling by Local Search
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
