A hybrid genetic algorithm for the job shop scheduling problem
From MaRDI portal
Publication:2484343
DOI10.1016/j.ejor.2004.03.012zbMath1075.90028MaRDI QIDQ2484343
Mauricio G. C. Resende, José Fernando Gonçalves, Jorge José de Magalhães Mendes
Publication date: 1 August 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.22/10058
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Ejection chain and filter-and-fan methods in combinatorial optimization, Double layer ACO algorithm for the multi-objective FJSSP, A random key based genetic algorithm for the resource constrained project scheduling problem, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, A filter-and-fan approach to the job shop scheduling problem, A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, A new particle swarm optimization for the open shop scheduling problem, A genetic algorithm for the resource constrained multi-project scheduling problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- 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
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- 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
- Algorithms for Solving Production-Scheduling Problems
- Job Shop Scheduling by Local Search
- An effective hybrid optimization strategy for job-shop scheduling problems
