Makespan minimization in a job shop with a BPM using simulated annealing

A scheduling problem commonly observed in the metal working industry has been studied in this research effort -- A job shop equipped with one batch processing machine (BPM) and several unit-capacity machines has been considered. Given a set of jobs, their process routes,processing requirements, and...

Full description

Autores:

Rojas Santiago, Miguel
Vélez Gallego, Mario César
Damodaran, Purushothaman
Muthuswamy, Shanthi
Rojas Santiago, Miguel
Vélez Gallego, Mario César
Damodaran, Purushothaman
Muthuswamy, Shanthi

Tipo de recurso:

Fecha de publicación:

2013

Institución:

Universidad EAFIT

Repositorio:

Repositorio EAFIT

Idioma:

eng

OAI Identifier:

oai:repository.eafit.edu.co:10784/5038

Acceso en línea:

http://hdl.handle.net/10784/5038

Palabra clave:

Metal trade
Genetic algorithms
Heuristic programming
Simulation methods
Combinatorial optimization
INDUSTRIA METALÚRGICA
ALGORITMOS GENÉTICOS
PROGRAMACIÓN HEURÍSTICA
MÉTODOS DE SIMULACIÓN
OPTIMIZACIÓN COMBINATORIA
INDUSTRIA METALÚRGICA
ALGORITMOS GENÉTICOS
PROGRAMACIÓN HEURÍSTICA
MÉTODOS DE SIMULACIÓN
OPTIMIZACIÓN COMBINATORIA
Metal trade
Genetic algorithms
Heuristic programming
Simulation methods
Combinatorial optimization

Rights

closedAccess

License

Acceso cerrado