Buscar
Mostrando ítems 1-10 de 83
Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System
(World Scientific and Engineering Acad and Soc, 2009-01-01)
In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered ...
Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System
(World Scientific and Engineering Acad and Soc, 2009-01-01)
In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered ...
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
(Elsevier B.V., 2016-03-01)
The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. The MTSP is well known to be NP-hard. This paper presents a new hybrid ...
Beam search algorithms for minimizing tool switches on a flexible manufacturing system
(2009-12-01)
In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered ...
Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System
(World Scientific and Engineering Acad and Soc, 2014)
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
(Pergamon-Elsevier Science Ltd, 2016)
The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. The MTSP is well known to be NP-hard. This paper presents a new hybrid ...
Um algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas
(Universidade Federal de São Carlos (UFSCar), 2009-09-01)
No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se ...
Minimization of open orders: application of a re-distribution coordination policy
(Taylor & Francis Ltd, 2004-03-16)
This work considers an NP-Hard scheduling problem that is fundamental to the production planning of flexible machines, to cutting pattern industries and also to the design of VLSI circuits. A new asynchronous collective ...
Um algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas
(Universidade Federal de São Carlos (UFSCar), 2009-09-01)
No problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se ...
Um algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas
(Universidade Federal de São Carlos (UFSCar), 2014)