A hybrid genetic algorithm for the open shop scheduling problem

DOI10.1016/S0377-2217(99)00168-XzbMath0960.90039MaRDI QIDQ1576331

Ching-Fang Liaw

Publication date: 20 May 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingtabu searchopen shopgenetic algorithm

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scheduling two-machine preemptive open shops to minimize total completion time, A new particle swarm optimization for multi-objective open shop scheduling, New efficient heuristics for scheduling open shops with makespan minimization, Boosting ant colony optimization via solution prediction and machine learning, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, An effective heuristic algorithm for the partial shop scheduling problem, A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm, A simple model for the multiple traveling salesmen problem with single depot and multiple sink, An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., A tabu search approach for proportionate multiprocessor open shop scheduling, A review of some issues and identification of some barriers in the implementation of FMS, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Four decades of research on the open-shop scheduling problem to minimize the makespan, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Quality inspection scheduling for multi-unit service enterprises, Open shop cyclic scheduling, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, A new particle swarm optimization for the open shop scheduling problem, The museum visitor routing problem, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports, A contribution and new heuristics for open shop scheduling, A genetic algorithm for the proportionate multiprocessor open shop, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, A matheuristic for the generalized order acceptance and scheduling problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical and new heuristics for the open-shop problem: A computational evaluation
• A tabu search algorithm for the open shop scheduling problem
• Constructive heuristic algorithms for the open shop problem
• On some geometric methods in scheduling theory: A survey
• A branch \(\&\) bound algorithm for the open-shop problem
• A tabu search algorithm for the open shop problem
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• Future paths for integer programming and links to artificial intelligence
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• A genetic algorithm applied to a classic job-shop scheduling problem
• On a routing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Open-shop scheduling problems with dominated machines
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Algorithms for Solving Production-Scheduling Problems