Logo do repositório
 
Publicação

A new contribution for solving dynamic scheduling problems using a Tabu search

2002-07-24Comunicação em conferência Acesso aberto
Ver registo simples
datacite.subject.fosEngenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
datacite.subject.sdg09:Indústria, Inovação e Infraestruturas
dc.contributor.authorMadureira, Ana Maria
dc.contributor.authorRamos, Carlos
dc.contributor.authorSilva, Sívio do Carmo
dc.date.accessioned2026-05-07T13:22:58Z
dc.date.available2026-05-07T13:22:58Z
dc.date.issued2002-07-24
dc.description.abstractMany real-world optimisation problems are eventually dynamic. New jobs are to be added to the schedule, the quality of the raw material may be changing, new orders have to be included into the problem etc. In such cases, when the problem changes over the course of the optimisation, the purpose of the optimisation algorithm changes from finding an optimal solution to being able to continuously track the movement of the optimum through time. This paper starts by presenting a new scheduling method based on Tabu Search for the resolution of the dynamic Job-Shop Scheduling Problem, which considers job release times, job due dates and different assembly levels (parallel operations). This framework is based on a decomposition of the Job-Shop Scheduling Problem into a series of deterministic Single Machine Scheduling Problem (SMSP) and on a Tabu Search Algorithm, which solves each SMSP whose solutions are, then, integrated. An inter-machine activity coordination mechanism is described. Finally, the used approach adapts the resolution of the deterministic problem to the non-deterministic one in which changes may occur continually. This takes into account dynamic occurrences in a manufacturing system and adapts the current neighbourhood to a new regenerated neighbourhood.eng
dc.identifier.citationMadureira, A., Ramos, C. & Silva, S. C. (2002, July 24-27) A new contribution for solving dynamic scheduling problems using a Tabu search [Paper presentation]. Proceedings of the First International Workshop on Heuristics, Beijing, China.
dc.identifier.urihttp://hdl.handle.net/10400.22/32339
dc.language.isoeng
dc.peerreviewedyes
dc.publisherTsinghua University
dc.rights.uriN/A
dc.titleA new contribution for solving dynamic scheduling problems using a Tabu searcheng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2002-07-24
oaire.citation.conferencePlaceBeijing, China
oaire.citation.endPage78
oaire.citation.startPage69
oaire.citation.titleInternational Workshop on Heuristics
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameMadureira
person.familyNameRamos
person.givenNameAna Maria
person.givenNameCarlos
person.identifier.ciencia-id7F1D-5AF2-A101
person.identifier.ciencia-id1011-FAFC-AEBA
person.identifier.orcid0000-0002-0264-4710
person.identifier.orcid0000-0002-5143-1711
person.identifier.ridAAH-1056-2021
person.identifier.ridK-7403-2014
person.identifier.scopus-author-id8634629500
person.identifier.scopus-author-id7201559105
relation.isAuthorOfPublicationcd5e5eb7-cf63-48c6-b6b9-a9db2fedebab
relation.isAuthorOfPublication43ef055e-80e6-4b31-8400-2d3592927e03
relation.isAuthorOfPublication.latestForDiscoverycd5e5eb7-cf63-48c6-b6b9-a9db2fedebab

Ficheiros

Principais
A mostrar 1 - 1 de 1
Miniatura
Nome:
COM_MadureiraA_DEI_2002_1stInternationalWorkshopHeuristics.pdf
Tamanho:
12.07 MB
Formato:
Adobe Portable Document Format
Ver/Abrir
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
4.03 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Ver/Abrir

Coleções

ISEP – DEI – Comunicações em eventos científicos