A Particle Swarm Optimization for scheduling a fixed product open shop

Carlos Parra, Jose Antonio Ventura

Research output: Contribution to conferencePaper

Abstract

Particle Swarm Optimization (PSO) has been gaining attention in the literature due to the flexibility of the algorithm and its applicability to flow-shops, job-shops and vehicle routing problems, to name a few. In this work a PSO algorithm is utilized to solve a fixed product flexible open shop scheduling problem with transportation considerations, where K workers need to perform H tasks at each of J locations. Therefore the objective of the PSO algorithm is to assign the workers to tasks, while simultaneously routing the workers in a manner that minimizes the makespan. The algorithm must take into account the fact that traveling distances may be nontrivial and workers can be heterogeneous.

Original languageEnglish (US)
Pages2728-2735
Number of pages8
StatePublished - Jan 1 2013
EventIIE Annual Conference and Expo 2013 - San Juan, Puerto Rico
Duration: May 18 2013May 22 2013

Other

OtherIIE Annual Conference and Expo 2013
CountryPuerto Rico
CitySan Juan
Period5/18/135/22/13

Fingerprint

Particle swarm optimization (PSO)
Scheduling
Vehicle routing

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Parra, C., & Ventura, J. A. (2013). A Particle Swarm Optimization for scheduling a fixed product open shop. 2728-2735. Paper presented at IIE Annual Conference and Expo 2013, San Juan, Puerto Rico.
Parra, Carlos ; Ventura, Jose Antonio. / A Particle Swarm Optimization for scheduling a fixed product open shop. Paper presented at IIE Annual Conference and Expo 2013, San Juan, Puerto Rico.8 p.
@conference{62cd4b5ce52d4163900a9bac5520f664,
title = "A Particle Swarm Optimization for scheduling a fixed product open shop",
abstract = "Particle Swarm Optimization (PSO) has been gaining attention in the literature due to the flexibility of the algorithm and its applicability to flow-shops, job-shops and vehicle routing problems, to name a few. In this work a PSO algorithm is utilized to solve a fixed product flexible open shop scheduling problem with transportation considerations, where K workers need to perform H tasks at each of J locations. Therefore the objective of the PSO algorithm is to assign the workers to tasks, while simultaneously routing the workers in a manner that minimizes the makespan. The algorithm must take into account the fact that traveling distances may be nontrivial and workers can be heterogeneous.",
author = "Carlos Parra and Ventura, {Jose Antonio}",
year = "2013",
month = "1",
day = "1",
language = "English (US)",
pages = "2728--2735",
note = "IIE Annual Conference and Expo 2013 ; Conference date: 18-05-2013 Through 22-05-2013",

}

Parra, C & Ventura, JA 2013, 'A Particle Swarm Optimization for scheduling a fixed product open shop', Paper presented at IIE Annual Conference and Expo 2013, San Juan, Puerto Rico, 5/18/13 - 5/22/13 pp. 2728-2735.

A Particle Swarm Optimization for scheduling a fixed product open shop. / Parra, Carlos; Ventura, Jose Antonio.

2013. 2728-2735 Paper presented at IIE Annual Conference and Expo 2013, San Juan, Puerto Rico.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A Particle Swarm Optimization for scheduling a fixed product open shop

AU - Parra, Carlos

AU - Ventura, Jose Antonio

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Particle Swarm Optimization (PSO) has been gaining attention in the literature due to the flexibility of the algorithm and its applicability to flow-shops, job-shops and vehicle routing problems, to name a few. In this work a PSO algorithm is utilized to solve a fixed product flexible open shop scheduling problem with transportation considerations, where K workers need to perform H tasks at each of J locations. Therefore the objective of the PSO algorithm is to assign the workers to tasks, while simultaneously routing the workers in a manner that minimizes the makespan. The algorithm must take into account the fact that traveling distances may be nontrivial and workers can be heterogeneous.

AB - Particle Swarm Optimization (PSO) has been gaining attention in the literature due to the flexibility of the algorithm and its applicability to flow-shops, job-shops and vehicle routing problems, to name a few. In this work a PSO algorithm is utilized to solve a fixed product flexible open shop scheduling problem with transportation considerations, where K workers need to perform H tasks at each of J locations. Therefore the objective of the PSO algorithm is to assign the workers to tasks, while simultaneously routing the workers in a manner that minimizes the makespan. The algorithm must take into account the fact that traveling distances may be nontrivial and workers can be heterogeneous.

UR - http://www.scopus.com/inward/record.url?scp=84900338485&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84900338485&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84900338485

SP - 2728

EP - 2735

ER -

Parra C, Ventura JA. A Particle Swarm Optimization for scheduling a fixed product open shop. 2013. Paper presented at IIE Annual Conference and Expo 2013, San Juan, Puerto Rico.