The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

<div>Semipreemption-based adjustment of <svg height="9.52372pt" id="M272" style="vertical-align:-3.31356pt" version="1.1" viewbox="-0.0498162 -6.21016 10.3605 9.52372" width="10.3605pt" 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="M393 379C402 394 400 411 393 422C384 437 365 448 348 448C301 448 237 372 186 285H182L193 335C210 408 205 448 178 448C150 448 80 402 29 344L45 321C80 355 114 373 122 373C128 373 130 365 124 330C106 228 76 98 50 -5L57 -12C82 -5 112 3 132 6L172 203C196 256 234 304 254 329C275 355 293 367 306 367C318 367 330 360 342 348C347 343 355 343 365 350S386 367 393 379Z" id="g113-115"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="422" vert-adv-y="422"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,5.108,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/#ex2">2</a>).</div>

Journal of Applied Mathematics

fig7

Figure 7

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