The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

<div>Schedule provided by <svg height="9.04777pt" id="M448" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 18.0503 9.04777" width="18.0503pt" 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="M828 650H570L564 622C646 614 650 609 634 524L604 366H253L281 524C296 608 308 615 382 622L388 650H132L126 622C211 615 214 609 198 524L121 122C106 42 102 35 23 28L17 0H276L282 28C196 35 191 40 206 122L243 324H597L559 123C544 42 537 35 452 28L446 0H710L716 28C632 35 628 43 643 122L719 524C735 610 741 615 822 622L828 650Z" id="g113-73"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="840" vert-adv-y="840"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,11.384,0)"><path d="M412 140C382 77 369 73 315 73H129L270 222C362 320 402 379 402 466C402 571 322 635 234 635C177 635 130 609 99 576L42 495L64 475C90 514 133 568 201 568C274 568 318 519 318 435C318 349 255 267 193 193C144 135 87 78 32 23V0H405C417 45 427 89 440 131L412 140Z" id="g113-51"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g></svg> for Example <a href="https://static.hindawi.com/articles/jam/volume-2014/273567/figures/#ex4">4</a>.</div>

Journal of Applied Mathematics

fig11

Figure 11

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