A Selective Scheduling Problem with Sequence-dependent Setup Times: A Risk-averse Approach

This paper addresses a scheduling problem with parallel identical machines and sequence-dependent setup times in which the setup and the processing times are random parameters. The model aims at minimizing the total completion time while the total revenue gained by the processed jobs satisfies the manufacturer’s threshold. To handle the uncertainty of random parameters, we adopt a risk-averse distributionally robust approach developed based on the Conditional Value-at-Risk measure hedging against the worst-case performance. The proposed model is tested via extensive experimental results performed on a set of benchmark instances. We also show the efficiency of the deterministic counterpart of our model, in comparison with the state-of-the-art model proposed for a similar problem in a deterministic context.