A decomposition approach to the solution of large-scale scheduling problems
When planning the manufacturing of a discrete medium-sized product we are faced with the problem of scheduling which involves sequencing of and assigning deadlines to several tens and even hundreds of thousands of activities (technological processes or jobs). For larger products, these numbers are substantially greater. Therefore, activity scheduling in this context is unpracticable unless the original problem can be partitioned into subproblems and the solutions obtained for the individual subproblems can then be combined into a solution of the original problem. The proposed decomposition and aggregation method employs a modification of the combinatorial algorithm presented in a previous paper of the author [Avtom. Telemekh. 1982, No.4, 72-77 (1982)], utilizing the network properties of the data describing the product and the manufacturing technology. In this way the scheduling subproblems need not be solved by an exact method and any heuristic single-pass method with a priority rule is quite adequate for these purposes. This appears to be the only practicable approach to the solution of scheduling problems in acceptable time.
- A large scale timetabling problem
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- scientific article; zbMATH DE number 433057 (Why is no real title available?)
- scientific article; zbMATH DE number 3887406 (Why is no real title available?)
- scientific article; zbMATH DE number 3945853 (Why is no real title available?)
- scientific article; zbMATH DE number 3961314 (Why is no real title available?)
- Multi-Item Scheduling by Benders' Decomposition
- Scheduling larger job shops: a decomposition approach
- Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux
- A decomposition scheduling method for operating flexible manufacturing systems
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Solution of a large-scale two-stage decision and scheduling problem using decomposition
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
This page was built for publication: A decomposition approach to the solution of large-scale scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796447)
