A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

<div>Solution generation by using the third row of <svg height="14.7729pt" id="M243" style="vertical-align:-3.051pt" version="1.1" viewbox="-0.0498162 -11.7219 34.1196 14.7729" width="34.1196pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M567 167L534 181C505 122 482 94 454 70C428 46 385 42 330 42C288 42 248 44 235 55C216 70 213 91 220 130L295 528C310 609 314 611 401 618L409 650H140L131 618C222 611 224 609 209 528L133 126C118 47 108 41 25 33L18 0H497C514 33 554 126 567 167Z" id="g50-77"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="579" vert-adv-y="579"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,8.398,3.001)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z" id="g50-53"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,13.344,0)"><path d="M309 -142C211 -61 151 99 151 271S210 601 309 683L288 710C141 611 75 451 75 272V271C75 90 141 -72 288 -169L309 -142Z" id="g50-41"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="358" vert-adv-y="358"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,17.998,0)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z" id="g50-51"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,24.33,-5.872)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z" id="g50-52"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,29.276,0)"><path d="M283 271C283 451 220 610 70 710L48 683C146 603 207 443 207 271S149 -59 48 -142L70 -169C220 -67 283 90 283 271Z" id="g50-42"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="358" vert-adv-y="358"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems 