Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/53148
Título: | Variable neighborhood search for integrated planning and scheduling |
Autor(es): | Leite, Mário Alves, Cláudio Pinto, Telmo |
Palavras-chave: | Heuristics Integrated optimization problems Metaheuristics Planning Scheduling |
Data: | 2017 |
Editora: | Springer Verlag |
Revista: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Resumo(s): | In this paper, we consider the integrated planning and scheduling problem on parallel and identical machines. The problem is composed by two parts which are simultaneously solved in an integrated form. The first is the planning part, which consists in determining the jobs that should be processed in each period of time. The second is the scheduling part, which consists in assigning the jobs to the machines according to their release dates. We present new optimization approaches based on local search heuristics and metaheuristic methods based on variable neighborhood search using two neighborhood structures. Two different algorithms were implemented in the construction of initial solutions and combined with fifteen variants of the initial sequence of jobs. Computational experiments were performed with benchmark instances from the literature in order to assess the proposed methods. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/53148 |
ISBN: | 9783319623948 |
DOI: | 10.1007/978-3-319-62395-5_49 |
ISSN: | 0302-9743 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito UMinho |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Artigo ICCSA 2017.pdf Acesso restrito! | 881,56 kB | Adobe PDF | Ver/Abrir |