The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

<div>Preemption-based adjustment of <svg height="12.9915pt" id="M210" style="vertical-align:-3.3136pt" version="1.1" viewbox="-0.0498162 -9.6779 12.7131 12.9915" width="12.7131pt" 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="M530 686C535 705 530 712 521 712C504 712 448 684 359 674L358 648H393C437 648 439 646 429 593L400 435C372 447 345 448 332 448C286 448 194 414 144 373C68 311 23 203 23 111C23 26 57 -12 91 -12C120 -12 147 3 188 29C227 54 290 102 341 170H343L322 71C308 6 320 -12 341 -12C373 -12 442 27 501 96L485 120C455 91 422 67 408 67C401 67 401 76 404 91C440 294 479 473 530 686ZM387 375L355 241C326 187 200 53 142 53C126 53 109 73 109 130C109 217 154 337 218 381C240 396 265 404 297 404S372 390 387 375Z" id="g113-101"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="555" vert-adv-y="555"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,7.452,3.264)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg> (Example <a href="https://static.hindawi.com/articles/jam/volume-2014/273567/figures/#ex1">1</a>).</div>

Journal of Applied Mathematics

fig6

Figure 6

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