A branch \& bound algorithm for the open-shop problem
From MaRDI portal
Publication:1363739
Recommendations
- A new lower bound for the open-shop problem
- Constructive heuristic algorithms for the open shop problem
- An optimal constraint programming approach to the open-shop problem
- Efficient approximation algorithms for the routing open shop problem
- A tabu search algorithm for the open shop problem
- A branch and bound algorithm for the flow-shop scheduling problem
- The Routing Open Shop Problem: New Approximation Algorithms
- A Note On The Complexity Of Openshop Scheduling Problems
- A branch and bound algorithm for the job-shop scheduling problem
- On the set of solutions of the open shop problem
Cites work
- scientific article; zbMATH DE number 4078750 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Note On The Complexity Of Openshop Scheduling Problems
- A branch and bound algorithm for the job-shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- Benchmarks for basic scheduling problems
- Constructive heuristic algorithms for the open shop problem
- Open Shop Scheduling to Minimize Finish Time
- Open shop problems with unit time operations
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- The job-shop problem and immediate selection
- The one-machine sequencing problem
- Two-Machine Open Shops with Renewable Resources
Cited in
(46)- A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- A tabu search algorithm for the open shop problem
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Solving the open shop scheduling problem
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- Dynamic programming approach for solving the open shop problem
- Compiling finite linear CSP into SAT
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A review on integrated scheduling and outbound vehicle routing problems
- New efficient heuristics for scheduling open shops with makespan minimization
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Multi-resource shop scheduling with resource flexibility
- Open-shop dense schedules: properties and worst-case performance ratio
- An effective heuristic algorithm for the partial shop scheduling problem
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- A new particle swarm optimization for the open shop scheduling problem
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Job-shop scheduling with processing alternatives.
- Local search with constraint propagation and conflict-based heuristics
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
- The museum visitor routing problem
- An optimal constraint programming approach to the open-shop problem
- The LPT heuristic for minimizing total load on a proportionate openshop
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- The Routing Open Shop Problem: New Approximation Algorithms
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A contribution and new heuristics for open shop scheduling
- A new lower bound for the open-shop problem
- Scheduling two-machine preemptive open shops to minimize total completion time
- A study on open shop scheduling to minimise total tardiness
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Open shop cyclic scheduling
- scientific article; zbMATH DE number 764418 (Why is no real title available?)
- A hybrid genetic algorithm for the open shop scheduling problem
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- Open shop scheduling problems with conflict graphs
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
This page was built for publication: A branch \(\&\) bound algorithm for the open-shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363739)
