• 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.

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

Thumbnail
Files
Minimizing makespan in a two-machine no-wait flow shop with batch processing machines.pdf (655.7Kb)
Date
2012-11-01
2012-11-01
Author(s)
Muthuswamy, Shanthi
Vélez Gallego, Mario César
Rojas Santiago, Miguel
Maya Toro, Jairo
Muthuswamy, Shanthi
Vélez Gallego, Mario César
Rojas Santiago, Miguel
Maya Toro, Jairo
Metrics
Metadata
Show full item record
Abstract
Abstract
Given 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 problems
Documents PDF

loading
 
URI
http://hdl.handle.net/10784/5029
Source / Editor URL
The International Journal of Advanced Manufacturing Technology, Volume 63, Issue 1-4, pp 281-290
http://dx.doi.org/10.1007/s00170-012-3906-9#
DOI
10.1007/s00170-012-3906-9#
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) (604) - 448 95 00
Resto del país: 01 8000 515 900
Conmutador: (57) (604) - 2619500
Carrera 49 N 7 Sur - 50
Medellín, Colombia, Suramérica

Derechos Reservados

DSpace software
copyright © 2002-2016 
Duraspace

Theme by 
@mire NV