Minimizing makespan in a two-machine no-wait flow shop with batch processing machines

Vista sencilla de ítem
dc.citation.journalTitleThe International Journal of Advanced Manufacturing Technologyeng
dc.contributor.authorMuthuswamy, Shanthi
dc.contributor.authorVélez Gallego, Mario César
dc.contributor.authorRojas Santiago, Miguel
dc.contributor.authorMaya Toro, Jairo
dc.contributor.authorMuthuswamy, Shanthi
dc.contributor.authorVélez Gallego, Mario César
dc.contributor.authorRojas Santiago, Miguel
dc.contributor.authorMaya Toro, Jairo
dc.contributor.departmentUniversidad EAFIT. Grupo de Investigación Gestión de Producción y Logística
dc.contributor.departmentUniversidad EAFIT. Departamento de Ingeniería de Producción
dc.contributor.eafitauthorsmuthuswamy@niu.eduspa
dc.contributor.eafitauthormarvelez@eafit.edu.cospa
dc.contributor.eafitauthorjmaya@eafit.edu.cospa
dc.contributor.eafitauthormiguelrojas@uninorte.edu.cospa
dc.contributor.researchgroupGestión de Producción y Logísticaspa
dc.date.accessioned2015-02-27T19:21:20Z
dc.date.accessioned2015-02-27T19:21:20Z
dc.date.available2015-02-27T19:21:20Z
dc.date.available2015-02-27T19:21:20Z
dc.date.issued2012-11-01
dc.date.issued2012-11-01
dc.description.abstractGiven a set of jobs and two batch processing machines (BPMs) arranged in a flow shop environment,the objective is to batch the jobs and sequence the batches such that the makespan is minimized. The job sizes, ready times, and processing times on the two BPMs are knowN -- The batch processing machines can process a batch of jobs as long as the total size of all the jobs assigned to a batch does not exceed its capacity -- Once the jobs are batched, the processing time of the batch on the first machine is equal to the longest processing job in the batch; processing time of the batch on the second machine is equal to the sum of processing times of all the jobs in the batch -- The batches cannot wait between two machines (i.e., no-wait) -- The problem under study is NP-hard -- We propose a mathematical formulation and present a particle swarm optimization (PSO) algorithm -- The solution quality and run time of PSO is compared with a commercial solver used to solve the mathematical formulation Experimental study clearly highlights the advantages, in terms of solution quality and run time, of using PSO to solve large-scale problemseng
dc.identifier.citationMuthuswamy, Shanthi, et al. "Minimizing makespan in a two-machine no-wait flow shop with batch processing machines." The International Journal of Advanced Manufacturing Technology 63.1-4 (2012): 281-290.spa
dc.identifier.doi10.1007/s00170-012-3906-9#
dc.identifier.issn0268-3768spa
dc.identifier.issn1433-3015spa
dc.identifier.issn02683768
dc.identifier.issn14333015
dc.identifier.urihttp://hdl.handle.net/10784/5029
dc.language.isoengeng
dc.language.isoeng
dc.publisherSpringer-Verlagspa
dc.publisherSpringer-Verlag
dc.relation.ispartofThe International Journal of Advanced Manufacturing Technology, Volume 63, Issue 1-4, pp 281-290spa
dc.relation.urihttp://dx.doi.org/10.1007/s00170-012-3906-9#
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccessspa
dc.rights.localAcceso cerradospa
dc.subjectNo-wait flow shopeng
dc.subjectBatch processing machineseng
dc.subjectParticle swarm optimizationeng
dc.subjectMakespaneng
dc.subject.keywordNo-wait flow shopspa
dc.subject.keywordBatch processing machinesspa
dc.subject.keywordParticle swarm optimizationspa
dc.subject.keywordMakespanspa
dc.titleMinimizing makespan in a two-machine no-wait flow shop with batch processing machineseng
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/articleeng
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.hasVersionpublishedVersionspa
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