Scheduling over scenarios on two machines
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all scenarios are given explicitly. The two objective...
Guardado en:
Publicado: |
2014
|
---|---|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8591LNCS_n_p559_Feuerstein http://hdl.handle.net/20.500.12110/paper_03029743_v8591LNCS_n_p559_Feuerstein |
Aporte de: |
Ejemplares similares
-
Scheduling over scenarios on two machines
por: Feuerstein, E., et al. -
An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013)