A branch \& bound algorithm for the open-shop problem

DOI10.1016/S0166-218X(96)00116-3zbMATH Open0882.90066OpenAlexW2015241450MaRDI QIDQ1363739FDOQ1363739

Authors: Peter Brucker, Bernd Jurisch, Birgit Wöstmann, 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

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

zbMATH Keywords

branch-and-bounddisjunctive graphopen-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Open Shop Scheduling to Minimize Finish Time
• The one-machine sequencing problem
• A branch and bound algorithm for the job-shop scheduling problem
• Benchmarks for basic scheduling problems
• An Algorithm for Solving the Job-Shop Problem
• Constructive heuristic algorithms for the open shop problem
• A Note On The Complexity Of Openshop Scheduling Problems
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Two-Machine Open Shops with Renewable Resources
• The job-shop problem and immediate selection
• Open shop problems with unit time operations
• Title not available (Why is that?)

Cited In (46)

• A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
• Open shop scheduling problems with conflict graphs
• A new particle swarm optimization for the open shop scheduling problem
• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
• Local search with constraint propagation and conflict-based heuristics
• An optimal constraint programming approach to the open-shop problem
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• Open shop cyclic scheduling
• A review on integrated scheduling and outbound vehicle routing problems
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• The Routing Open Shop Problem: New Approximation Algorithms
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• Scheduling two-machine preemptive open shops to minimize total completion time
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• 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
• An effective heuristic algorithm for the partial shop scheduling problem
• The museum visitor routing problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Job-shop scheduling with processing alternatives.
• A contribution and new heuristics for open shop scheduling
• A new lower bound for the open-shop problem
• A study on open shop scheduling to minimise total tardiness
• Multi-resource shop scheduling with resource flexibility
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
• Title not available (Why is that?)
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
• New efficient heuristics for scheduling open shops with makespan minimization
• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
• Compiling finite linear CSP into SAT
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• Open-shop dense schedules: properties and worst-case performance ratio
• Solving the open shop scheduling problem
• An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
• The LPT heuristic for minimizing total load on a proportionate openshop
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
• Classical and new heuristics for the open-shop problem: A computational evaluation
• A tabu search algorithm for the open shop problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems

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)