Using different chromosome representations for the JSS problem
Nearly all practical scheduling problems can be described in terms of the job-shop scheduling problem, in which L jobs are to be processed by M machines. Each job will have a set of constraints on the order in which machines can be used; moreover the processing time on each machine is specified for...
Guardado en:
| Autores principales: | Salto, Carolina, Hugo, Alfonso, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21674 |
| Aporte de: |
Ejemplares similares
-
Alternative representations and multirecombined approaches for solving the single-machine common due date problem
por: Villagra, Andrea, et al.
Publicado: (2001) -
Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002) -
A hybrid evolutionary algorithm: multirecombination with priority rule base representation abstract for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2000) -
Theory of problem solving ; an approach to artificial intelligence /
por: Banerji, Ranan B., 1928-
Publicado: (1969) -
Different evolutionary approaches to solve the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)