Schedule Generation Schemes for Job Shop Problems with Fuzziness
EstadísticasView Usage Statistics
Full recordShow full item record
We consider the job shop scheduling problem with fuzzy durations and expected makespan minimisation. We formally define the space of semi-active and active fuzzy schedules and propose and analyse different schedule-generation schemes (SGSs) in this fuzzy framework. In particular, we study dominance properties of the set of schedules obtained with each SGS. Finally, a computational study illustrates the great difference between the spaces of active and the semi-active fuzzy schedules, an analogous behaviour to that of the deterministic job shop.