Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

Algorithm 1

Dynamic programming.

Step 1: for , we can calculate by (39a), (39b), and (40) for all possible values , , and .

 Step 2: define

 Step 3: structure the optimal V-shaped schedule that obtains due to the backward tracking process