A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization

Cites Work

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
The museum visitor routing problem
Classical and new heuristics for the open-shop problem: A computational evaluation
A branch \(\&\) bound algorithm for the open-shop problem
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
New approximate algorithms for the customer order scheduling problem with total completion time objective
Order scheduling with tardiness objective: improved approximate solutions
Heuristic methods for the single-machine scheduling problem with periodical resource constraints
SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
New efficient heuristics for scheduling open shops with makespan minimization
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
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
A genetic algorithm for scheduling open shops with sequence-dependent setup times
Benchmarks for basic scheduling problems
Two machine open shop scheduling problem with setup, processing and removal times separated
An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
A study on open shop scheduling to minimise total tardiness
Statistical mechanics of complex networks
Principles of Constraint Programming
Open Shop Scheduling to Minimize Finish Time
Constraint Programming
Manufacturing Scheduling Systems

This page was built for publication: A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization