A hybrid genetic algorithm for the open shop scheduling problem
From MaRDI portal
Publication:1576331
DOI10.1016/S0377-2217(99)00168-XzbMATH Open0960.90039MaRDI QIDQ1576331FDOQ1576331
Publication date: 20 May 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a routing problem
- Future paths for integer programming and links to artificial intelligence
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Applying tabu search to the job-shop scheduling problem
- Open Shop Scheduling to Minimize Finish Time
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Algorithms for Solving Production-Scheduling Problems
- Benchmarks for basic scheduling problems
- Open-shop scheduling problems with dominated machines
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Constructive heuristic algorithms for the open shop problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- On some geometric methods in scheduling theory: A survey
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A branch \(\&\) bound algorithm for the open-shop problem
- A tabu search algorithm for the open shop problem
- A tabu search algorithm for the open shop scheduling problem
- A genetic algorithm applied to a classic job-shop scheduling problem
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
Cited In (33)
- A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- 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
- Boosting ant colony optimization via solution prediction and machine learning
- A tabu search approach for proportionate multiprocessor open shop scheduling
- A new particle swarm optimization for the open shop scheduling problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- Open shop cyclic scheduling
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- A review of some issues and identification of some barriers in the implementation of FMS
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- 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
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- An effective heuristic algorithm for the partial shop scheduling problem
- The museum visitor routing problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A new particle swarm optimization for multi-objective open shop scheduling
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A contribution and new heuristics for open shop scheduling
- New efficient heuristics for scheduling open shops with makespan minimization
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- A genetic algorithm for the proportionate multiprocessor open shop
- A matheuristic for the generalized order acceptance and scheduling problem
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
Uses Software
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 👍 👎
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)
