Models and Algorithm for Flow-shop Scheduling in Birandom Environment

摘要

This paper deals with flow-shop scheduling problems in a birandom environment. A spectrum of birandom scheduling models are presented, which includes expected value programming, chance-constrained programming, and dependent-chance programming models. A hybrid intelligent algorithm is specially designed to solve these models and its effectiveness is illustrated by some numerical experiments.