Solving the permutation flow shop problem with blocking and setup time constraints
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 models, originally proposed for the no setup pro...
Main Authors: | Mauricio Iwama Takano, Marcelo Seido Nagano |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2020-03-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_31.pdf |
Similar Items
-
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
by: Damla Kizilay, et al.
Published: (2019-05-01) -
A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times
by: Mauricio Iwama Takano, et al.
Published: (2017-01-01) -
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times
by: Mauricio Iwama Takano, et al.
Published: (2019-01-01) -
Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
by: João Vitor Moccellin, et al.
Published: (2007-01-01) -
Uma contribuição para o problema de programação de operações flow shop com buffer zero e tempos de setup dependente da sequência e da máquina
by: Mauricio Iwama Takano
Published: (2016)