A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
From MaRDI portal
Publication:2183852
DOI10.1016/j.ejor.2020.02.010zbMath1441.90065OpenAlexW3006629774MaRDI QIDQ2183852
Gonzalo Mejía, Francisco Yuraszeck
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.02.010
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
Uses Software
Cites Work
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Scheduling open shops with parallel machines to minimize total completion time
- Minimizing the sum of weighted completion times in a concurrent open shop
- A contribution and new heuristics for open shop scheduling
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- The museum visitor routing problem
- A genetic algorithm for the proportionate multiprocessor open shop
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- A tabu search algorithm for the open shop scheduling problem
- A branch \(\&\) bound algorithm for the open-shop problem
- A tabu search algorithm for the open shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- A new lower bound for the open-shop problem
- Multi-objective open shop scheduling by considering human error and preventive maintenance
- Benchmarks for basic scheduling problems
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- A new particle swarm optimization for the open shop scheduling problem
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
- A hybrid genetic algorithm for the job shop scheduling problem
- Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
- An Optimal Constraint Programming Approach to the Open-Shop Problem
- A new particle swarm optimization for multi-objective open shop scheduling
- Two-machine open shop scheduling with secondary criteria
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- Open Shop Scheduling to Minimize Finish Time
- Polynomial time approximation algorithms for proportionate open‐shop scheduling
- Scheduling
- Variable neighborhood search: Principles and applications
This page was built for publication: A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
