A hybrid genetic algorithm for the open shop scheduling problem
From MaRDI portal
(Redirected from Publication:1576331)
Recommendations
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- A hybrid genetic algorithm for the job shop scheduling problem
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- An improved genetic algorithm for the flowshop scheduling problem
Cites work
- scientific article; zbMATH DE number 432815 (Why is no real title available?)
- scientific article; zbMATH DE number 4170628 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3825546 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A branch \(\&\) bound algorithm for the open-shop problem
- A genetic algorithm applied to a classic job-shop scheduling problem
- A tabu search algorithm for the open shop problem
- A tabu search algorithm for the open shop scheduling problem
- Algorithms for Solving Production-Scheduling Problems
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Benchmarks for basic scheduling problems
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Constructive heuristic algorithms for the open shop problem
- Future paths for integer programming and links to artificial intelligence
- On a routing problem
- On some geometric methods in scheduling theory: A survey
- Open Shop Scheduling to Minimize Finish Time
- Open-shop scheduling problems with dominated machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(34)- A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A new particle swarm optimization for multi-objective open shop scheduling
- Hybrid simulated annealing and genetic algorithms for industrial production management problems
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Quality inspection scheduling for multi-unit service enterprises
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- New efficient heuristics for scheduling open shops with makespan minimization
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- A matheuristic for the generalized order acceptance and scheduling problem
- An effective heuristic algorithm for the partial shop scheduling problem
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- A new particle swarm optimization for the open shop scheduling problem
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- The museum visitor routing problem
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A contribution and new heuristics for open shop scheduling
- A genetic algorithm for the proportionate multiprocessor open shop
- Boosting ant colony optimization via solution prediction and machine learning
- Scheduling two-machine preemptive open shops to minimize total completion time
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Open shop cyclic scheduling
- Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm
- A review of some issues and identification of some barriers in the implementation of FMS
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
This page was built for publication: A hybrid genetic algorithm for the open shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576331)
