Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/90156
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Leite, Mário Manuel Silva | por |
dc.contributor.author | Pinto, Telmo | por |
dc.contributor.author | Alves, Cláudio | por |
dc.date.accessioned | 2024-03-27T14:16:35Z | - |
dc.date.available | 2024-07-01T06:01:06Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | Leite, M. M. S., Pinto, T. M. P., & Alves, C. M. M. (2023, October). Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms. Expert Systems with Applications. Elsevier BV. http://doi.org/10.1016/j.eswa.2023.120191 | por |
dc.identifier.issn | 0957-4174 | por |
dc.identifier.uri | https://hdl.handle.net/1822/90156 | - |
dc.description.abstract | In this paper, we address the Integrated Planning and Scheduling Problem (IPSP) on parallel and identical machines. Planning and scheduling are essential for the efficient management of supply chains. Although both pursue the same general objective, they are usually performed independently mostly because they relate to different timescales. As a consequence, the generated plans and schedules are typically sub-optimal from a global standpoint. The approaches followed in this paper explicitly consider the interdependence between the planning and scheduling activities by solving them simultaneously in an integrated way. We explore different heuristics based on variable neighborhood search procedures with new and specifically designed neighborhood structures relying on the properties of the IPSP. The quality of these approaches is evaluated through extensive computational experiments performed on a large set of benchmark instances. The results show that the proposed methods achieve high-quality solutions, with a substantially low computation time, outperforming other state-of-the-art results reported in the literature. | por |
dc.description.sponsorship | The first author has been supported by FCT – Fundação para a Ciência e Tecnologia, through national funds from MCTES – Ministério da Ciência, Tecnologia e Ensino Superior, and by European Social Fund through NORTE2020 – Programa Operacional Regional Norte, within the research grant SFRH/BD/146217/2019. The second and third authors have been supported by FCT – Fundação para a Ciência e a Tecnologia within the R&D Units Project Scope: UIDB/00319/2020. The second author has been supported by national funds through FCT – Fundação para a Ciência e a Tecnologia, under the project UIDB/00285/2020 | por |
dc.language.iso | por | por |
dc.publisher | Elsevier | por |
dc.relation | info:eu-repo/grantAgreement/FCT/POR_NORTE/SFRH%2FBD%2F146217%2F2019/PT | por |
dc.relation | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F00319%2F2020/PT | por |
dc.relation | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F00285%2F2020/PT | por |
dc.rights | openAccess | por |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | por |
dc.subject | Identical parallel machines scheduling | por |
dc.subject | Production planning and scheduling | por |
dc.subject | Variable neighborhood search | por |
dc.title | Solving the integrated planning and scheduling problemusing variable neighborhood search based algorithms | por |
dc.type | article | por |
dc.peerreviewed | yes | por |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0957417423006930 | por |
oaire.citationVolume | 228 | por |
dc.identifier.doi | 10.1016/j.eswa.2023.120191 | por |
sdum.journal | Expert Systems with Applications | por |
sdum.conferencePublication | 3 | por |
oaire.version | VoR | por |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
esa_23.pdf | 3,64 MB | Adobe PDF | Ver/Abrir |
Este trabalho está licenciado sob uma Licença Creative Commons