Scheduling larger job shops: a decomposition approach
From MaRDI portal
Publication:4230201
Recommendations
- Decomposition methods for large job shops
- A decomposition approach to the solution of large-scale scheduling problems
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- A linear programming-based method for job shop scheduling
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
Cites work
- Algorithms for Solving Production-Scheduling Problems
- An Algorithm for Solving the Job-Shop Problem
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 4055449 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Job-Shop Scheduling by Implicit Enumeration
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(10)- The job shop tardiness problem: A decomposition approach
- Decomposition methods for large job shops
- Nested partitions for the large-scale extended job shop scheduling problem
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- scientific article; zbMATH DE number 3945853 (Why is no real title available?)
- A decomposition approach to job-shop scheduling problem with discretely controllable processing times
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Solution of a large-scale two-stage decision and scheduling problem using decomposition
- A decomposition approach to the solution of large-scale scheduling problems
This page was built for publication: Scheduling larger job shops: a decomposition approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230201)