Approximating a global objective by solving repeated sub-problems for an oven scheduling problem
| dc.contributor.author | Simonis, Helmut | en |
| dc.contributor.funder | Science Foundation Ireland | en |
| dc.date.accessioned | 2024-10-10T15:00:19Z | |
| dc.date.available | 2024-10-10T15:00:19Z | |
| dc.date.issued | 2024-09-02 | en |
| dc.description.abstract | In this paper we describe results for an oven scheduling problem studied during the European ASSISTANT project. This is a multi-stage scheduling problem arising in the production of rotor assemblies for compressors, provided by one of the industrial partners in the consortium. The main resource type is a set of identical ovens, which are used to heat-treat components in different ways. The process for one product may require multiple consecutive steps using these ovens, with specific temperature and process requirements at each step. Multiple tasks of different orders can be processed together in the same oven, if the temperature and process parameters for the tasks are identical. Processing multiple tasks together is more energy efficient, but typically forces some tasks to wait until all scheduled items are available, possibly impacting product quality and creating delays for the orders. The main difference to the oven scheduling problem studied in the literature is that we are not just trying to find an optimal solution to the short-term, detailed scheduling problem, but rather are interested in how selecting different parameters and constraints for the short-term scheduling problem affects the overall long-term, global objective of minimizing energy use, while maintaining the quality of products. Turning ovens off and then on again is considered bad for energy and maintenance reasons, we therefore try to minimize the number of shutdown events over the full planning horizon, while dealing with demand fluctuations over time. Information about jobs to be scheduled is only available within a limited time horizon, we therefore cannot solve the overall problem as one global optimization problem. Results indicate that we obtain a good overall schedule with a simple detailed scheduling model. | en |
| dc.description.status | Peer reviewed | en |
| dc.description.version | Accepted Version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Simonis, H. (2024) 'Approximating a Global Objective by Solving Repeated Sub-problems for an Oven Scheduling Problem', ModRef 2024: The 23rd workshop on Constraint Modelling and Reformulation, part of CP 2024: The 30th International Conference on Principles and Practice of Constraint Programming, 2-6 Sept. Girona, Catalonia. | en |
| dc.identifier.endpage | 23 | en |
| dc.identifier.startpage | 1 | en |
| dc.identifier.uri | https://hdl.handle.net/10468/16514 | |
| dc.language.iso | en | en |
| dc.publisher | ModRef 2024 | en |
| dc.relation.ispartof | CP 2024: The 30th International Conference on Principles and Practice of Constraint Programming | en |
| dc.relation.ispartof | ModRef 2024: The 23rd workshop on Constraint Modelling and Reformulation | en |
| dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ | en |
| dc.rights | © the authors 2024. This publication has emanated from research conducted with the financial support of Science Foundation Ireland under Grant number 12/RC/2289-P2 at Insight the SFI Research Centre for Data Analytics at UCC, which is co-funded under the European Regional Development Fund. For the purpose of Open Access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. | en |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject | Scheduling | en |
| dc.subject | Global objective | en |
| dc.subject | Oven scheduling | en |
| dc.subject | Constraint programming | en |
| dc.subject | Applied computing | en |
| dc.subject | Industry and manufacturing | en |
| dc.title | Approximating a global objective by solving repeated sub-problems for an oven scheduling problem | en |
| dc.type | Conference item | en |
