7   Artículos

« Anterior     Página: 1 de 1     Siguiente »

 
en línea
Christophe Sauvey and Nathalie Sauer    
Since its creation by Nawaz, Enscore, and Ham in 1983, NEH remains the best heuristic method to solve flowshop scheduling problems. In the large body of literature dealing with the application of this heuristic, it can be clearly noted that results diffe... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Miguel Ângelo Teixeira, José Silva Coelho    
Este artigo apresenta uma meta-heurística baseada na escalada do monte para o problema ?flowshop? de permutação (PFSP). O algoritmo é descrito e são propostas cinco afinações, que foram testadas e comparadas entre si e com o algoritmo proposto. É feito u... ver más
Revista: Revista de Ciências da Computação    Formato: Electrónico

 
en línea
Nesrine Touafek, Fatima Benbouzid-Si Tayeb and Asma Ladj    
In the last decades, the availability constraint as well as learning and deteriorating effects were introduced into the production scheduling theory to simulate real-world case studies and to overcome the limitation of the classical models. To the best o... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Jose M. Framinan and Rainer Leisten    
The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are based on properties of the jobs to be scheduled (e.g., their ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Felipe Borreiro Sanches, Mauricio Iwama Takano, Marcelo Seido Nagano (Author)     Pág. 321 - 326
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be... ver más
Revista: Acta Scientiarum: Technology    Formato: Electrónico

 
en línea
Felipe Borreiro Sanches, Mauricio Iwama Takano, Marcelo Seido Nagano     Pág. 321 - 326
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be... ver más
Revista: Acta Scientiarum: Technology    Formato: Electrónico

 
en línea
Luís Cavique    
Apresentamos o mais recente número da Revista de Ciências da Computação. As primeiras palavras de agradecimento vão para os autores, para os membros do conselho editorial encarregues das revisões científicas e para os revisores de língua portuguesa e ing... ver más
Revista: Revista de Ciências da Computação    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »