Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

<table>The behavior of IS as <svg height="12.4375" id="M279" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 9.5124998 12.4375" width="9.5124998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M529 97q-70 -109 -136 -109q-41 0 -56 94q-23 144 -37 284q-38 -88 -99 -202.5t-93 -156.5q-26 -8 -76 -19l-9 21q71 78 145.5 193t124.5 232q-5 84 -15 128q-12 55 -29.5 75.5t-42.5 20.5q-21 0 -45 -13l-8 24q16 17 46 30t55 13q43 0 70 -46.5t40 -169.5
q27 -249 51 -392q7 -46 23 -46q24 0 70 60z" id="x1D706"></path></g>
</svg> changes at <svg height="11.125" id="M280" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 44.400002 11.125" width="44.400002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g><g transform="matrix(.017,-0,0,-.017,13.305,10.862)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,28.008,10.862)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g><g transform="matrix(.017,-0,0,-.017,36.168,10.862)"><path d="M456 178h-96v-72q0 -51 12.5 -62.5t72.5 -16.5v-27h-256v27q65 5 78 17t13 62v72h-260v28q182 271 300 426h40v-407h96v-47zM280 225v295h-2q-107 -148 -196 -295h198z" id="x34"></path></g>
</svg>.</table>

Mathematical Problems in Engineering

fig11

Figure 11

Figure 11: Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times 