Logo do repositório
 
Publicação

A Genetic Approach for Dynamic Job-Shop Scheduling Problems

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.date.accessioned2026-03-23T11:08:22Z
dc.date.available2026-03-23T11:08:22Z
dc.date.issued2001-07-20
dc.description.abstract[Introduction] Since Davis [4] proposed the first Genetic Algorithm(GA) to address scheduling problems in 1985, GAs have been widely used in manufacturing scheduling applications. However, most of the works deal with optimisation of the scheduling problem in static environments, whereas many real world problems are dynamic, frequently subject. to several sorts of random occurrences and perturbations, such as random job releases, machine breakdowns, jobs cancellation and due date and time processing changes. Due to their dynamic nature, real scheduling problems have an additional complexity in relation to static ones. In many situations these problems, even for apparently simple situations, are hard to solve, i.e. the time required to compute an optimal solution increases exponentially with the size of the problem [1]. GAs have been extensively used in the context of Job-Shop Scheduling Problems (JSSP). If all jobs are known before processing starts the JSSP is called static, while if job release times are not fixed at a single point in time, ie. jobs arrive to the system at different times, the problem is called dynamic. Scheduling problems can also be classified as deterministic, when processing times and all other parameters are known and fixed, and stochastic, when some or all parameters are uncertain [7]. The proposed approach deals with these two cases of dynamic scheduling: deterministic and stochastic. For such class of problems, the goal is no longer to find a single optimum, but rather to continuously adapt the solution to the changing environment. The purpose of this paper is to describe an approach based on GA for solving dynamic scheduling problems, where the products (jobs) to be processed have due dates. This paper starts by presenting a scheduling system, based on Genetic Algorithms for the resolution of the dynamic version of Single Machine Scheduling Problem (SMSP). The approach used adapts the resolution of the static problem to the dynamic one in which changes may occur continually. This takes into account dynamic occurrences in a system and adapts the current population to a new regenerated population. Then, it is proposed an approach for the resolution of the Job-Shop Scheduling Problem (JSSP) in dynamic environments. The paper is structured as follows: section 2 provides a description of the considered scheduling problem. Section 3 summarises an approach for the resolution of the Dynamic Single Machine Scheduling Problem. The proposed approach for dynamic scheduling is presented in section 4. Finally, the paper concludes with a summary and some ideas for future work.eng
dc.identifier.citationMadureira, A., Ramos, C. & Silva, S. C. (2001, July 16-20). A genetic approach for dynamic job-shop scheduling problems.[Conference paper] 4th Metaheuristics International Conference - MIC'2001. Porto, Portugal
dc.identifier.urihttp://hdl.handle.net/10400.22/32166
dc.language.isoeng
dc.peerreviewedyes
dc.publisherMIC'2001
dc.rights.uriN/A
dc.titleA Genetic Approach for Dynamic Job-Shop Scheduling Problemseng
dc.typeconference object
dspace.entity.typePublication
oaire.citation.conferenceDate2001-07-20
oaire.citation.conferencePlacePorto, Portugal
oaire.citation.titleMIC'2001 - 4th Metaheuristics International Conference
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 indisponível
Nome:
COM_MadureiraA_DEI_MIC2001_.pdf
Tamanho:
2.29 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: