• español
    • English
  • Self-archive
  • Browse
    • Communities & Collections
    • By Issue Date
    • Authors
    • Titles
    • Subjects
    • Document types
  • English 
    • español
    • English
  • Help
  • Login
 
View Item 
  •   Repositorio Institucional Universidad EAFIT
  • Investigación
  • Escuela de Ingeniería
  • Gestión de Producción y Logística
  • Artículos
  • View Item
  •   Repositorio Institucional Universidad EAFIT
  • Investigación
  • Escuela de Ingeniería
  • Gestión de Producción y Logística
  • Artículos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
Makespan minimization in a job shop with a BPM using simulated annealing.pdf (610.7Kb)
Date
2013-03-08
Author
Rojas Santiago, Miguel
Vélez Gallego, Mario César
Damodaran, Purushothaman
Muthuswamy, Shanthi
Metrics
Metadata
Show full item record
Abstract
Abstract
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 size, the objective is to schedule the jobs such that the makespan is minimized -- The BPM can process a batch of jobs as long as its capacity is not exceeded -- The batch processing time is equal to the longest processing job in the batch -- If no batches were to be formed, the scheduling problem under study reduces to the classicaljob shop problem with makespan objective, which is known to be nondeterministic polynomial time-hard -- A network representation of the problem using disjunctive and conjunctive arcs, and a simulated annealing (SA) algorithm are proposed to solve the problem. The solution quality and run time of SA are compared with CPLEX, a commercial solver used to solve the mathematical formulation and with four dispatching rules -- Experimental study clearly highlights the advantages, in terms of solution quality and run time, of using SA to solve large-scale problems
Documents PDF

loading
URI
http://hdl.handle.net/10784/5038
Editor URL
The International Journal of Advanced Manufacturing Technology, 68, 9-12, 2383-2391p.
Collections
  • Artículos [14]

My Account

LoginRegister

Statistics

View Usage Statistics

universidad eafit medellin repositorio institucional

Vigilada Mineducación
Universidad con Acreditación Institucional hasta 2026
Resolución MEN 2158 de 2018

Líneas de Atención

Medellín: (57) (4) - 448 95 00
Resto del país: 01 8000 515 900
Conmutador: (57) (4) - 2619500
Carrera 49 N 7 Sur - 50
Medellín, Colombia, Suramérica

Derechos Reservados

DSpace software
copyright © 2002-2016 
Duraspace

Theme by 
@mire NV