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 prob...
| Main Authors: | , |
|---|---|
| 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 |