A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates

<table>Splitting of the original job sequence in the cases <svg height="15" id="M185" style="vertical-align:-3.27605pt" version="1.1" viewbox="0 0 55.724998 15" width="55.724998" 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="M545 106q-67 -118 -134 -118q-24 0 -40 37.5t-30 129.5h-2q-47 -72 -103 -119.5t-108 -47.5q-47 0 -76 45.5t-29 119.5q0 113 85 204t174 91q47 0 70 -33.5t43 -119.5h3q32 47 80 140l55 13l10 -9q-47 -80 -138 -201q17 -99 27.5 -136t22.5 -37q23 0 69 61zM333 204
q-14 98 -31 149.5t-50 51.5q-49 0 -94 -70t-45 -164q0 -55 15.5 -86t40.5 -31q70 0 164 150z" id="x1D6FC"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.712,14.938)"><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,20.775,10.862)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,35.462,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,43.621,10.862)"><path d="M113 -12q-24 0 -39.5 16t-15.5 42q0 24 16 40.5t40 16.5t40 -16.5t16 -40.5q0 -26 -16 -42t-41 -16z" id="x2E"></path></g><g transform="matrix(.017,-0,0,-.017,47.497,10.862)"><path d="M241 635q53 0 94 -28.5t63.5 -76t33.5 -102.5t11 -116q0 -58 -11 -112.5t-34 -103.5t-63.5 -78.5t-94.5 -29.5t-95 28t-64.5 75t-34.5 102.5t-11 118.5q0 58 11.5 112.5t34.5 103t64.5 78t95.5 29.5zM238 602q-32 0 -55.5 -25t-35.5 -68t-17.5 -91t-5.5 -105
q0 -76 10 -138.5t37 -107.5t69 -45q32 0 55.5 25t35.5 68.5t17.5 91.5t5.5 105t-5.5 105.5t-18 92t-36 68t-56.5 24.5z" id="x30"></path></g>
</svg> and <svg height="15" id="M186" style="vertical-align:-3.27605pt" version="1.1" viewbox="0 0 55.724998 15" width="55.724998" 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="M545 106q-67 -118 -134 -118q-24 0 -40 37.5t-30 129.5h-2q-47 -72 -103 -119.5t-108 -47.5q-47 0 -76 45.5t-29 119.5q0 113 85 204t174 91q47 0 70 -33.5t43 -119.5h3q32 47 80 140l55 13l10 -9q-47 -80 -138 -201q17 -99 27.5 -136t22.5 -37q23 0 69 61zM333 204
q-14 98 -31 149.5t-50 51.5q-49 0 -94 -70t-45 -164q0 -55 15.5 -86t40.5 -31q70 0 164 150z" id="x1D6FC"></path></g>
<g transform="matrix(.012,-0,0,-.012,9.712,14.938)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g>
<g transform="matrix(.017,-0,0,-.017,20.775,10.862)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,35.462,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,43.621,10.862)"><path d="M113 -12q-24 0 -39.5 16t-15.5 42q0 24 16 40.5t40 16.5t40 -16.5t16 -40.5q0 -26 -16 -42t-41 -16z" id="x2E"></path></g><g transform="matrix(.017,-0,0,-.017,47.497,10.862)"><path d="M153 550l-26 -186q79 31 111 31q90 0 141.5 -51t51.5 -119q0 -93 -89 -166q-85 -69 -173 -71q-32 0 -61.5 11.5t-41.5 23.5q-18 17 -17 34q2 16 22 33q14 9 26 -1q61 -50 124 -50q60 0 93 43.5t33 104.5q0 69 -41.5 110t-121.5 41q-53 0 -102 -20l38 305h286l6 -8
l-26 -65h-233z" id="x35"></path></g>
</svg>.</table>

Discrete Dynamics in Nature and Society

fig1

Figure 1

Figure 1: A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates 