A generalized permutation approach to job shop scheduling with genetic algorithms
From MaRDI portal
Publication:1908992
DOI10.1007/BF01719250zbMATH Open0843.90056MaRDI QIDQ1908992FDOQ1908992
Publication date: 19 August 1996
Published in: OR Spektrum (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A Computational Study of the Job-Shop Scheduling Problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Evolution based learning in a job shop scheduling environment
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
Cited In (36)
- A memetic algorithm for the job-shop with time-lags
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
- Job shop scheduling optimization through multiple independent particle swarms
- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier
- Minimizing makespan for scheduling stochastic job shop with random breakdown
- A repairing technique for the local search of the job-shop problem.
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems
- Genetic tabu search for the fuzzy flexible job shop problem
- Scatter search with path relinking for the job shop with time lags and setup times
- Integration of process planning and scheduling for distributed flexible job shops
- A memetic algorithm for restoring feasibility in scheduling with limited makespan
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- An algebraic approach for the search space of permutations with repetition
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
- The job shop scheduling problem: Conventional and new solution techniques
- A competent memetic algorithm for complex scheduling
- Deterministic job-shop scheduling: Past, present and future
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- Some new results on simulated annealing applied to the job shop scheduling problem
- Job-Shop Scheduling with Mixed Blocking Constraints between Operations
- Metaheuristics: A bibliography
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Resolution of a scheduling problem in a flowshop robotic cell
- Supercomputer Scheduling with Combined Evolutionary Techniques
- Firefly algorithm hybridized with genetic algorithm for multi-objective integrated process planning and scheduling
- Cultural-based genetic tabu algorithm for multiobjective job shop scheduling
Uses Software
This page was built for publication: A generalized permutation approach to job shop scheduling with genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908992)
