Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/434653/figures/434653.fig.002a.svgz" name="434653.fig.002a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Order sequence: 1, 2, 3, 4</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/434653/figures/434653.fig.002b.svgz" name="434653.fig.002b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Order sequence: 2, 1, 3, 4</td></tr></table>

<div>Lot-order assignments using the compact pegging method for two order sequences.</div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times 

Figure 2 | Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times 