A branch and bound algorithm for the job-shop scheduling problem
From MaRDI portal
Publication:1327223
DOI10.1016/0166-218X(94)90204-6zbMath0802.90057MaRDI QIDQ1327223
Peter Brucker, Bernd Jurisch, Bernd Sievers
Publication date: 18 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Mixed multigraph approach to scheduling jobs on machines of different types∗, Alternative graph formulation for solving complex factory-scheduling problems, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Solving the open shop scheduling problem, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Scheduling and constraint propagation, Jackson's pseudo-preemptive schedule and cumulative scheduling problems, Tabu search algorithms for job-shop problems with a single transport robot, Permutation-induced acyclic networks for the job shop scheduling problem, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, New single machine and job-shop scheduling problems with availability constraints, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, A branch and bound method for the job-shop problem with sequence-dependent setup times, Hybrid rollout approaches for the job shop scheduling problem, Two branch and bound algorithms for the permutation flow shop problem, The job shop scheduling problem: Conventional and new solution techniques, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Tabu search for the job-shop scheduling problem with multi-purpose machines, A branch and bound algorithm for the job-shop scheduling problem, The job-shop problem and immediate selection, Evolution based learning in a job shop scheduling environment, A branch \(\&\) bound algorithm for the open-shop problem, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, Look ahead job demanding for improving job shop performance, Job-shop scheduling: Computational study of local search and large-step optimization methods, A repairing technique for the local search of the job-shop problem., Decomposition methods for reentrant flow shops with sequence-dependent setup times, Constraint propagation techniques for the disjunctive scheduling problem, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, Decomposition methods for large job shops, A tabu search algorithm for scheduling a single robot in a job-shop environment, A tabu search approach to machine scheduling, Maximization of solution flexibility for robust shop scheduling, Lower bounds for the job-shop scheduling problem on multi-purpose machines, Resource-constrained project scheduling: Notation, classification, models, and methods, Deterministic job-shop scheduling: Past, present and future, Job-shop scheduling with blocking and no-wait constraints, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, Nested partitions for the large-scale extended job shop scheduling problem, Applying tabu search to the job-shop scheduling problem, No-wait job shop scheduling: tabu search and complexity of subproblems, A hybrid genetic algorithm for the job shop scheduling problem, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Applying machine based decomposition in 2-machine flow shops, Study on constraint scheduling algorithm for job shop problems with multiple constraint machines
Uses Software
Cites Work
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A block approach for single-machine scheduling with release dates and due dates
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- A new lower bound for the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
