Inés González Rodríguez, Jorge Puente Peinador, María Camino Rodríguez Vela
We consider a job shop problem with uncertain durations and flexible due dates and introduce a multiobjective model based on lexicographical minimisation. To solve the resulting problem, a genetic algorithm and a decoding algorithm to generate possibly active schedules are considered. The multiobjective approach is tested on several problem instances, illustrating the potential of the proposed method.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados