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

Vista sencilla de ítem
dc.citation.journalTitleThe International Journal of Advanced Manufacturing Technologyeng
dc.contributor.authorRojas Santiago, Miguel
dc.contributor.authorVélez Gallego, Mario César
dc.contributor.authorDamodaran, Purushothaman
dc.contributor.authorMuthuswamy, Shanthi
dc.contributor.authorRojas Santiago, Miguel
dc.contributor.authorVélez Gallego, Mario César
dc.contributor.authorDamodaran, Purushothaman
dc.contributor.authorMuthuswamy, Shanthi
dc.contributor.departmentUniversidad EAFIT. Departamento de Ingeniería de Producción
dc.contributor.eafitauthormarvelez@eafit.edu.cospa
dc.contributor.researchgroupGestión de Producción y Logísticaspa
dc.date.accessioned2015-02-27T20:18:51Z
dc.date.accessioned2015-02-27T20:18:51Z
dc.date.available2015-02-27T20:18:51Z
dc.date.available2015-02-27T20:18:51Z
dc.date.issued2013-03-08
dc.date.issued2013-03-08
dc.description.abstractA 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 problemseng
dc.identifier.citationMiguel Rojas-Santiago, Purushothaman Damodaran, Shanthi Muthuswamy, Mario C. Vélez-Gallego. Makespan minimization in a job shop with a BPM using simulated annealing. The International Journal of Advanced Manufacturing Technology, (In Press).DOI: 10.1007/s00170-013-4858-4. ISSN: 0268-3768.spa
dc.identifier.doi10.1007/s00170-013-4858-4
dc.identifier.issn0268-3768spa
dc.identifier.issn1433-3015spa
dc.identifier.issn0268-3768
dc.identifier.issn1433-3015
dc.identifier.urihttp://hdl.handle.net/10784/5038
dc.language.isoengeng
dc.language.isoeng
dc.publisherSpringer Londonspa
dc.publisherSpringer London
dc.relation.ispartofThe International Journal of Advanced Manufacturing Technology, 68, 9-12, 2383-2391p.spa
dc.relation.urihttp://doi.org/10.1007/s00170-013-4858-4
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.rights.accessrightsinfo:eu-repo/semantics/closedAccesseng
dc.rights.localAcceso cerradospa
dc.subjectMetal tradeeng
dc.subjectGenetic algorithmseng
dc.subjectHeuristic programmingeng
dc.subjectSimulation methodseng
dc.subjectCombinatorial optimizationeng
dc.subjectINDUSTRIA METALÚRGICAspa
dc.subjectALGORITMOS GENÉTICOSspa
dc.subjectPROGRAMACIÓN HEURÍSTICAspa
dc.subjectMÉTODOS DE SIMULACIÓNspa
dc.subjectOPTIMIZACIÓN COMBINATORIAspa
dc.subject.keywordMetal tradeeng
dc.subject.keywordGenetic algorithmseng
dc.subject.keywordHeuristic programmingeng
dc.subject.keywordSimulation methodseng
dc.subject.keywordCombinatorial optimizationeng
dc.subject.lembINDUSTRIA METALÚRGICAspa
dc.subject.lembALGORITMOS GENÉTICOSspa
dc.subject.lembPROGRAMACIÓN HEURÍSTICAspa
dc.subject.lembMÉTODOS DE SIMULACIÓNspa
dc.subject.lembOPTIMIZACIÓN COMBINATORIAspa
dc.titleMakespan minimization in a job shop with a BPM using simulated annealingeng
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/articleeng
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.hasVersionpublishedVersioneng
dc.type.hasVersionObra publicadaspa
dc.type.localArtículospa

Archivos

Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
2.5 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar

Colecciones

Artículos