Flow Shops, Job Shops and Open Shops (Stochastic)

Abstract

This chapter focuses first on non-preemptive static list policies, ie, permutation schedules, for stochastic flow shops. The optimal permutation schedules often remain optimal in the class of non-preemptive dynamic policies as well as in the class of preemptive dynamic policies. For …