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

DOI10.1080/0305215x.2021.1957101zbMath1523.90195OpenAlexW3193192892MaRDI QIDQ6048209

Levi Ribeiro de Abreu, Marcelo Seido Nagano, Bruno de Athayde Prata, João Vitor Moccellin, Unnamed Author

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1957101

zbMATH Keywords

makespanconstraint programmingexact methodsproduction sequencing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flexible open shop scheduling problem to minimize makespan
• Open shop scheduling problem to minimize makespan with release dates
• Two-machine flow shop and open shop scheduling problems with a single maintenance window
• A contribution and new heuristics for open shop scheduling
• The museum visitor routing problem
• Variable neighbourhood search: methods and applications
• The two-machine total completion time flow shop problem
• Classical and new heuristics for the open-shop problem: A computational evaluation
• A tabu search algorithm for the open shop scheduling problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Variable neighborhood search
• Competitive genetic algorithms for the open-shop scheduling problem
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
• Variable neighborhood search: basics and variants
• Order scheduling with tardiness objective: improved approximate solutions
• A new lower bound for the open-shop problem
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Dynamic programming approach for solving the open shop problem
• Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Multi-objective open shop scheduling by considering human error and preventive maintenance
• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Benchmarks for basic scheduling problems
• A new particle swarm optimization for the open shop scheduling problem
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
• Constraint programming model for multi-manned assembly line balancing problem
• A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
• A study on open shop scheduling to minimise total tardiness
• Principles of Constraint Programming
• Open Shop Scheduling to Minimize Finish Time
• New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions

This page was built for publication: A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions