Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Mauricio Iwama Takano"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 13, Iss 2, Pp 255-266 (2022)
In this paper it is presented an improvement of the branch and bound algorithm for the permutation flow shop problem with blocking-in-process and setup times with the objective of minimizing the total flow time and tardiness, which is known to be NP-
Externí odkaz:
https://doaj.org/article/061d84253eea43a99261d160d9509fac
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 11, Iss 3, Pp 469-480 (2020)
In this paper, the flow shop with blocking and sequence and machine dependent setup time problem aiming to minimize the makespan is studied. Two mixed-integer programming models are proposed (TNZBS1 and TNZBS2) and two other mixed-integer programming
Externí odkaz:
https://doaj.org/article/75286bf3ebbf4e249f69e878ff26077e
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 10, Iss 1, Pp 37-50 (2019)
This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permu
Externí odkaz:
https://doaj.org/article/0cb5ffcca5b44eb6af57994fd65693bb
Publikováno v:
Acta Scientiarum: Technology, Vol 38, Iss 3, Pp 321-326 (2016)
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 t
Externí odkaz:
https://doaj.org/article/d72a163182ec45eb95b5eda1953357a3
Publikováno v:
Cogent Engineering, Vol 4, Iss 1 (2017)
This work addresses the minimization of the makespan criterion for the permutation flow shop problem with blocking, sequence and machine dependent setup times, which is a problem that has not been studied in previous works. Many papers considered the
Externí odkaz:
https://doaj.org/article/c243f8e22f5f488690df87fabc095259
Autor:
Mauricio Iwama Takano
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.
O problema do sequenciamento da produção diz respeito à alocação das tarefas nas máquinas em um ambiente de fabricação, o qual vem sendo amplamente estudado. O sequenciamento pode variar em tamanho e complexidade dependendo do tipo de ambient
Publikováno v:
Production Research ISBN: 9783030763060
This paper presents an improvement of the branch-and-bound algorithm for the blocking-in-process and setup times permutation flow shop problem with total flow time criterion, which is known to be NP-Hard for m ≥ 2. For that, a new machine-based low
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b9495cc8dc604b995d47a691c303a65
https://doi.org/10.1007/978-3-030-76307-7_17
https://doi.org/10.1007/978-3-030-76307-7_17
Publikováno v:
Proceedings of the 25th International Congress of Mechanical Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::737f312d582b2a32fc28f1ad56bb2e77
https://doi.org/10.26678/abcm.cobem2019.cob2019-1761
https://doi.org/10.26678/abcm.cobem2019.cob2019-1761
Autor:
Mauricio Iwama Takano
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USP
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
O problema do sequenciamento da produção diz respeito à alocação das tarefas nas máquinas em um ambiente de fabricação, o qual vem sendo amplamente estudado. O sequenciamento pode variar em tamanho e complexidade dependendo do tipo de ambient
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::6b47b53159952736a8beef6f3e9e930b