Solving the job-shop scheduling problem optimally by dynamic programming
From MaRDI portal
Recommendations
- A branch and bound algorithm for the job-shop scheduling problem
- A new approach to computing optimal schedules for the job-shop scheduling problem
- A Computational Study of the Job-Shop Scheduling Problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
Cites work
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 1775452 (Why is no real title available?)
- scientific article; zbMATH DE number 6472637 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- A Dynamic Programming Approach to Sequencing Problems
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A branch and bound algorithm for the job-shop scheduling problem
- A filter-and-fan approach to the job shop scheduling problem
- A genetic algorithm for the job shop problem
- A new approach to computing optimal schedules for the job-shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- Computational Complexity of Discrete Optimization Problems
- Deterministic job-shop scheduling: Past, present and future
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Evolution based learning in a job shop scheduling environment
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Improved Approximation Algorithms for Shop Scheduling Problems
- Job Shop Scheduling by Simulated Annealing
- Job-Shop Scheduling by Implicit Enumeration
- Makespan minimization in job shops: a polynomial time approximation scheme
- Open problems around exact algorithms
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Two simulated annealing-based heuristics for the job shop scheduling problem
Cited in
(19)- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- Efficient algorithms for flexible job shop scheduling with parallel machines
- A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
- Dynamic programming approach for solving the open shop problem
- scientific article; zbMATH DE number 5175842 (Why is no real title available?)
- Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm
- Genetic algorithm modification for production scheduling
- A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context
- Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- A linear programming-based method for job shop scheduling
- An optimal method for the preemptive job shop scheduling problem
- Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
- Deep policy dynamic programming for vehicle routing problems
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
This page was built for publication: Solving the job-shop scheduling problem optimally by dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339631)
