Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop (2013)
- Authors:
- Autor USP: RONCONI, DEBORA PRETTI - EP
- Unidade: EP
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; PROGRAMAÇÃO DA PRODUÇÃO; MODELOS MATEMÁTICOS; HEURÍSTICA
- Language: Inglês
- Abstract: An Iterated Local Search (ILS) is used to minimize total tardiness in the Flexible Job Shop. New priority rules associated with list scheduling algorithms that exploit characteristics of the problem are proposed. The ILS uses a larger neighborhood than the literature reference. Computational tests using a new set of 600 instances show that the proposed priority rules outperform the literature rules. Moreover the proposed ILS has a better performance than the literature reference metaheuristc
- Imprenta:
- Source:
- Título do periódico: Minneapolis 2013: Informs Annual Meeting
- Conference titles: Informs Annual Meeting
-
ABNT
MELO, Everton Luiz de e RONCONI, Débora Pretti. Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop. 2013, Anais.. S.l: INFORMS, 2013. . Acesso em: 21 maio 2024. -
APA
Melo, E. L. de, & Ronconi, D. P. (2013). Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop. In Minneapolis 2013: Informs Annual Meeting. S.l: INFORMS. -
NLM
Melo EL de, Ronconi DP. Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop. Minneapolis 2013: Informs Annual Meeting. 2013 ;[citado 2024 maio 21 ] -
Vancouver
Melo EL de, Ronconi DP. Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop. Minneapolis 2013: Informs Annual Meeting. 2013 ;[citado 2024 maio 21 ] - Heurísticas construtivas para a minimização do atraso total no ambiente job shop flexível
- Busca tabu para a minimização do tempo total de atraso no problema de flowshop
- A note on constructive heuristics for the flowshop problem with blocking
- A branch-and-bound algorithm to minimize the makespan in flowshop with blocking
- Programação de ordens de produção, com diferentes instantes de liberação, para uma data única de entrega
- Aplicação do método branch-and-bound na programação de tarefas em uma única máquina com data de entrega comum sob penalidades de adiantamento e atraso
- Some heuristic algorithms for total tardiness minimization in a flowshop with blocking.
- Minimising total tardiness on a flowshop with blocking in process
- Tópicos em métodos de otimização para programação de tarefas e problemas correlatos
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date.
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
