A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852): Difference between revisions

Latest revision as of 09:47, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times	scientific article

Statements

instance of

scholarly article

0 references

title

A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

27 May 2020

0 references

zbMATH Keywords

scheduling

0 references

open shop

0 references

variable neighborhood search

0 references

sequence-dependent setup times

0 references

travel times

0 references

describes a project that uses

Beam-ACO

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2020.02.010

0 references

cites work

A tabu search algorithm for the open shop problem

0 references

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

0 references

A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network

0 references

Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling

0 references

Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

0 references

A branch \(\&\) bound algorithm for the open-shop problem

0 references

Complexity results for flow-shop and open-shop scheduling problems with transportation delays

0 references

A hybrid genetic algorithm for the job shop scheduling problem

0 references

Open Shop Scheduling to Minimize Finish Time

0 references

A new lower bound for the open-shop problem

0 references

Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems

0 references

Two-machine open shop scheduling with secondary criteria

0 references

Variable neighborhood search: Principles and applications

0 references

Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop

0 references

A tabu search algorithm for the open shop scheduling problem

0 references

A hybrid genetic algorithm for the open shop scheduling problem

0 references

A new particle swarm optimization for multi-objective open shop scheduling

0 references

An Optimal Constraint Programming Approach to the Open-Shop Problem

0 references

Minimizing the sum of weighted completion times in a concurrent open shop

0 references

A genetic algorithm for the proportionate multiprocessor open shop

0 references

Polynomial time approximation algorithms for proportionate open‐shop scheduling

0 references

A contribution and new heuristics for open shop scheduling

0 references

Scheduling open shops with parallel machines to minimize total completion time

0 references

Scheduling

0 references

Competitive genetic algorithms for the open-shop scheduling problem

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

A new particle swarm optimization for the open shop scheduling problem

0 references

Multi-objective open shop scheduling by considering human error and preventive maintenance

0 references

A heuristic for the two-machine open-shop scheduling problem with transportation times

0 references

Benchmarks for basic scheduling problems

0 references

The museum visitor routing problem

0 references

SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

0 references

Identifiers

zbMATH Open document ID

1441.90065

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2020.02.010

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2183852

@@ Property / DOI @@
-.1016/j.ejor.2020.02.010
@@ Property / DOI: 10.1016/j.ejor.2020.02.010 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Beam-ACO
@@ Property / describes a project that uses: Beam-ACO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2020.02.010
+Normal rank
@@ Property / OpenAlex ID @@
+W3006629774
@@ Property / OpenAlex ID: W3006629774 / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the open shop problem
@@ Property / cites work: A tabu search algorithm for the open shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
+Normal rank
@@ Property / cites work @@
+A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
+Normal rank
@@ Property / cites work @@
+Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
+Normal rank
@@ Property / cites work @@
+Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
+Normal rank
@@ Property / cites work @@
+A branch \(\&\) bound algorithm for the open-shop problem
+Normal rank
@@ Property / cites work @@
+Complexity results for flow-shop and open-shop scheduling problems with transportation delays
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound for the open-shop problem
@@ Property / cites work: A new lower bound for the open-shop problem / rank @@
+Normal rank
@@ Property / cites work @@
+Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
+Normal rank
@@ Property / cites work @@
+Two-machine open shop scheduling with secondary criteria
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the open shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm for the open shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A new particle swarm optimization for multi-objective open shop scheduling
+Normal rank
@@ Property / cites work @@
+An Optimal Constraint Programming Approach to the Open-Shop Problem
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of weighted completion times in a concurrent open shop
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the proportionate multiprocessor open shop
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for proportionate open‐shop scheduling
+Normal rank
@@ Property / cites work @@
+A contribution and new heuristics for open shop scheduling
+Normal rank
@@ Property / cites work @@
+Scheduling open shops with parallel machines to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive genetic algorithms for the open-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+A new particle swarm optimization for the open shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Multi-objective open shop scheduling by considering human error and preventive maintenance
+Normal rank
@@ Property / cites work @@
+A heuristic for the two-machine open-shop scheduling problem with transportation times
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+The museum visitor routing problem
@@ Property / cites work: The museum visitor routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2020.02.010
@@ Property / DOI: 10.1016/J.EJOR.2020.02.010 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2183852