The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

<div>Illustration of the permutation <svg height="12.1605pt" id="M309" style="vertical-align:-5.75996pt" version="1.1" viewbox="-0.0498162 -6.40054 15.3816 12.1605" width="15.3816pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M548 455L523 469C505 448 490 439 461 439C416 439 374 447 316 447C144 447 23 310 23 161C23 47 89 -12 179 -12C312 -12 429 106 429 244C429 303 419 344 368 386L371 388C404 383 440 378 474 378C507 378 530 411 548 455ZM350 274C350 191 308 25 198 25C144 25 108 75 108 157C108 264 170 395 276 395C296 395 320 384 333 360C347 334 350 316 350 274Z" id="g113-240"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="565" vert-adv-y="565"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,7.045,3.264)"><path d="M400 606C400 634 383 656 353 656C316 656 294 620 294 593C294 564 317 545 343 545C375 545 400 573 400 606ZM366 351C379 413 381 451 356 451C323 451 251 408 183 341L199 313C223 335 267 365 277 365C285 365 284 354 277 312C245 132 222 27 193 -100C182 -148 160 -188 131 -188C113 -188 90 -178 75 -170C64 -164 55 -168 48 -175C38 -185 24 -203 24 -222S48 -257 71 -257C89 -257 131 -241 186 -192C243 -141 286 -46 310 74L366 351Z" id="g50-107"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="430" vert-adv-y="430"></glyph.data></g><g transform="matrix(.0068,0,0,-0.0068,10.886,5.453)"><path d="M455 312C455 472 400 635 248 635C95 635 39 458 39 312C39 144 93 -12 248 -12C400 -12 455 166 455 312ZM361 314C361 173 337 30 249 30C163 30 131 174 131 313C131 451 155 594 248 594C334 594 361 454 361 314Z" id="g176-49"></path><glyph.data ascent="3439" descent="-2858" horiz-adv-x="494" vert-adv-y="494"></glyph.data></g></svg>.</div>

Journal of Applied Mathematics

fig8

Figure 8

Figure 8: The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures 