A branch \(\&\) bound algorithm for the open-shop problem
From MaRDI portal
Publication:1363739
DOI10.1016/S0166-218X(96)00116-3zbMath0882.90066OpenAlexW2015241450MaRDI QIDQ1363739
Peter Brucker, Birgit Wöstmann, Bernd Jurisch, Johann L. Hurink
Publication date: 24 February 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
Scheduling two-machine preemptive open shops to minimize total completion time, 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 novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, A review on integrated scheduling and outbound vehicle routing problems, A study on open shop scheduling to minimise total tardiness, Job-shop scheduling with processing alternatives., Open-shop dense schedules: properties and worst-case performance ratio, An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Four decades of research on the open-shop scheduling problem to minimize the makespan, Open shop cyclic scheduling, A new particle swarm optimization for the open shop scheduling problem, The museum visitor routing problem, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, Solving the open shop scheduling problem, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, 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, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan, A hybrid genetic algorithm for the open shop scheduling problem, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, Multi-resource shop scheduling with resource flexibility, Classical and new heuristics for the open-shop problem: A computational evaluation, A genetic algorithm for scheduling open shops with sequence-dependent setup times, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, 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, Open shop scheduling problems with conflict graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The one-machine sequencing problem
- Constructive heuristic algorithms for the open shop problem
- A branch and bound algorithm for the job-shop scheduling problem
- The job-shop problem and immediate selection
- Benchmarks for basic scheduling problems
- A Note On The Complexity Of Openshop Scheduling Problems
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- An Algorithm for Solving the Job-Shop Problem
- Open shop problems with unit time operations
- Open Shop Scheduling to Minimize Finish Time
- Two-Machine Open Shops with Renewable Resources
