A new lower bound for the open-shop problem
From MaRDI portal
Publication:1960317
DOI10.1023/A:1018930613891zbMath0958.90033OpenAlexW2118363183MaRDI QIDQ1960317
Christian Prins, Christelle Guéret
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018930613891
Related Items
A new particle swarm optimization for multi-objective open shop scheduling ⋮ Compiling finite linear CSP into SAT ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A column generation-based heuristic for a rehabilitation patient scheduling and routing problem ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ A study on open shop scheduling to minimise total tardiness ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A new particle swarm optimization for the open shop scheduling problem ⋮ Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling ⋮ Solving the open shop scheduling problem ⋮ Dynamic programming approach for solving the open shop problem ⋮ A contribution and new heuristics for open shop scheduling ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times ⋮ The total completion time open shop scheduling problem with a given sequence of jobs on one machine ⋮ Local search with constraint propagation and conflict-based heuristics
