A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209): Difference between revisions

Latest revision as of 03:55, 3 August 2024

scientific article; zbMATH DE number 7747882

Language	Label	Description	Also known as
English	A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions	scientific article; zbMATH DE number 7747882

Statements

instance of

scholarly article

0 references

title

A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (English)

0 references

zbMATH Open document ID

1523.90195

0 references

DOI

10.1080/0305215x.2021.1957101

0 references

author

Levi Ribeiro de Abreu

0 references

Q6048208

0 references

Bruno de Athayde Prata

0 references

Marcelo Seido Nagano

0 references

João Vitor Moccellin

0 references

published in

Engineering Optimization

0 references

publication date

10 October 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

production sequencing

0 references

makespan

0 references

constraint programming

0 references

exact methods

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/0305215x.2021.1957101

0 references

OpenAlex ID

W3193192892

0 references

cites work

A genetic algorithm for scheduling open shops with sequence-dependent setup times

0 references

Four decades of research on the open-shop scheduling problem to minimize the makespan

0 references

Principles of Constraint Programming

0 references

Open shop scheduling problem to minimize makespan with release dates

0 references

Flexible open shop scheduling problem to minimize makespan

0 references

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

0 references

Q4658190

0 references

Heuristic methods for the single-machine scheduling problem with periodical resource constraints

0 references

The two-machine total completion time flow shop problem

0 references

Order scheduling with tardiness objective: improved approximate solutions

0 references

Q4198056

0 references

Open Shop Scheduling to Minimize Finish Time

0 references

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

0 references

Classical and new heuristics for the open-shop problem: A computational evaluation

0 references

A new lower bound for the open-shop problem

0 references

A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints

0 references

Variable neighbourhood search: methods and applications

0 references

Variable neighborhood search: basics and variants

0 references

Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints

0 references

Constraint programming model for multi-manned assembly line balancing problem

0 references

An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling

0 references

IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG

0 references

A tabu search algorithm for the open shop scheduling problem

0 references

Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem

0 references

Variable neighborhood search

0 references

Q4220707

0 references

Two-machine flow shop and open shop scheduling problems with a single maintenance window

0 references

A contribution and new heuristics for open shop scheduling

0 references

A study on open shop scheduling to minimise total tardiness

0 references

Dynamic programming approach for solving the open shop problem

0 references

New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions

0 references

Competitive genetic algorithms for the open-shop scheduling problem

0 references

Q3184605

0 references

Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports

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

Benchmarks for basic scheduling problems

0 references

Q4821818

0 references

The museum visitor routing problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6048209

@@ Property / full work available at URL @@
+https://doi.org/10.1080/0305215x.2021.1957101
+Normal rank
@@ Property / OpenAlex ID @@
+W3193192892
@@ Property / OpenAlex ID: W3193192892 / rank @@
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for scheduling open shops with sequence-dependent setup times
+Normal rank
@@ Property / cites work @@
+Four decades of research on the open-shop scheduling problem to minimize the makespan
+Normal rank
@@ Property / cites work @@
+Principles of Constraint Programming
@@ Property / cites work: Principles of Constraint Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Open shop scheduling problem to minimize makespan with release dates
+Normal rank
@@ Property / cites work @@
+Flexible open shop scheduling problem to minimize makespan
+Normal rank
@@ Property / cites work @@
+A branch \(\&\) bound algorithm for the open-shop problem
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic methods for the single-machine scheduling problem with periodical resource constraints
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Order scheduling with tardiness objective: improved approximate solutions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 @@
+Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
+Normal rank
@@ Property / cites work @@
+Classical and new heuristics for the open-shop problem: A computational evaluation
+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 @@
+A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: basics and variants
@@ Property / cites work: Variable neighborhood search: basics and variants / rank @@
+Normal rank
@@ Property / cites work @@
+Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
+Normal rank
@@ Property / cites work @@
+Constraint programming model for multi-manned assembly line balancing problem
+Normal rank
@@ Property / cites work @@
+An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the open shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Q4220707
@@ Property / cites work: Q4220707 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine flow shop and open shop scheduling problems with a single maintenance window
+Normal rank
@@ Property / cites work @@
+A contribution and new heuristics for open shop scheduling
+Normal rank
@@ Property / cites work @@
+A study on open shop scheduling to minimise total tardiness
+Normal rank
@@ Property / cites work @@
+Dynamic programming approach for solving the open shop problem
+Normal rank
@@ Property / cites work @@
+New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions
+Normal rank
@@ Property / cites work @@
+Competitive genetic algorithms for the open-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Q3184605
@@ Property / cites work: Q3184605 / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
+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 @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+The museum visitor routing problem
@@ Property / cites work: The museum visitor routing problem / rank @@
+Normal rank