Logo do repositório
 
Publicação

Using tabu search for dynamic scheduling: the extended job-shop scheduling problem

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ílvio do Carmo
dc.contributor.editorKendall, Graham
dc.contributor.editorBurke, Edmund
dc.contributor.editorPetrovic, Sanja
dc.date.accessioned2026-05-04T12:47:16Z
dc.date.available2026-05-04T12:47:16Z
dc.date.issued2003-08-13
dc.description.abstractIn most practical environments, scheduling is an ongoing reactive process where the presence of real time information continually forces reconsideration and revision of pre-established schedules. Scheduling algorithms that achieve good or near optimal solutions and can efficiently adapt them to perturbations are, in most cases, preferable to those that achieve optimal ones but that cannot implement such an adaptation. This reality, motivated us to concentrate on tools, which could deal with such dynamic, disturbed scheduling problems, both for single and multi-machine manufacturing settings, even though, due to the complexity of these problems, optimal solutions may not be possible to find. We decided to address the problem drawing upon the potential of Tabu Search to deal with such complex situations.eng
dc.identifier.citationMadureira, A., Ramos, C. & Silva, S. C. (2003, August 13-16). Using tabu search for dynamic scheduling: the extended job-shop scheduling problem. In Kendall, G., Burke, E. & Petrovic, S. (Eds.) MISTA 2003: Proceedings of the 1st Multidisciplinary International Conference on Scheduling: theory and applications (Vol. 1).(pp.114-115). University of Nottingham, UK
dc.identifier.isbn0-9545821-0-1
dc.identifier.urihttp://hdl.handle.net/10400.22/32331
dc.language.isoeng
dc.peerreviewedyes
dc.publisherThe University of Nottingham
dc.relation.hasversionhttps://mistaconference.net/previous/?year=2003
dc.rights.uriN/A
dc.subjectDynamic scheduling
dc.subjectRescheduling
dc.subjectTabu search
dc.subjectDynamic adaptation
dc.titleUsing tabu search for dynamic scheduling: the extended job-shop scheduling problemeng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2003-08-13
oaire.citation.conferencePlaceThe University of Nottingham, UK
oaire.citation.endPage115
oaire.citation.startPage114
oaire.citation.titleMISTA 2003 - 1st Multidisciplinary International Conference on Scheduling: Theory and Applications
oaire.citation.volume1
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
A carregar...
Miniatura
Nome:
COM_MadureiraA_DEI_MISTA2003.pdf
Tamanho:
2.15 MB
Formato:
Adobe Portable Document Format
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: