CIVILICA We Respect the Science
Publisher of Iranian Journals and Conference Proceedings
Paper
title

A Population-based Simulated Annealing Algorithm for Flexible J obshop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

Credit to Download: 1 | Page Numbers 9 | Abstract Views: 183
Year: 2017
COI code: IIEC14_019
Paper Language: English

How to Download This Paper

For Downloading the Fulltext of CIVILICA papers please visit the orginal Persian Section of website.

Authors A Population-based Simulated Annealing Algorithm for Flexible J obshop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

  parviz fattahi - Department of Industrial Engineering, Alzahra University, Tehran, Iran
Fatemeh daneshamooz - Department of Industrial Engineering, Bu Ali-Sina University, Hamedan, Iran
sanaz keneshloo - Department of Industrial Engineering, Bu Ali-Sina University, Hamedan, Iran

Abstract:

In this research a flexible job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is studied. The objective function is to find a schedule which minimizes the makespan. First a mixed integer linear programming model is introduced to express ‘die problem and in order to demonstrate the accuracy of the presented model, some small instances are solved by GAMS. Due to the NP-hardness of the considered problem, a algorithm is used to solve the problem in medium to large sizes in reasonable amount of time. This algorithm is based on population based simulated annealing (PSA) algorithm. The results of ‘die proposed algorithm are compared with the result of simulated annealing algorithm. Computational results showed that for small problems, both PSA and SA have approximately the same performance. And in medium to large problems PSA outperforms SA. In addition, it is concluded that there is a direct relation between lot streaming technique and makespan time reduction.

Keywords:

flexible job shop; parallel assembly; lot streaming; PSA

Perma Link

https://www.civilica.com/Paper-IIEC14-IIEC14_019.html
COI code: IIEC14_019

how to cite to this paper:

If you want to refer to this article in your research, you can easily use the following in the resources and references section:
fattahi, parviz; Fatemeh daneshamooz & sanaz keneshloo, 2017, A Population-based Simulated Annealing Algorithm for Flexible J obshop Scheduling Problem with Lot streaming and A Parallel Assembly Stage, 14th International Industrial Engineering Conference, تهران, انجمن مهندسي صنايع ايران - دانشگاه علم و صنعت ايران, https://www.civilica.com/Paper-IIEC14-IIEC14_019.htmlInside the text, wherever referred to or an achievement of this article is mentioned, after mentioning the article, inside the parental, the following specifications are written.
First Time: (fattahi, parviz; Fatemeh daneshamooz & sanaz keneshloo, 2017)
Second and more: (fattahi; daneshamooz & keneshloo, 2017)
For a complete overview of how to citation please review the following CIVILICA Guide (Citation)

Scientometrics

The University/Research Center Information:
Type: state university
Paper No.: 5016
in University Ranking and Scientometrics the Iranian universities and research centers are evaluated based on scientific papers.

Research Info Management

Export Citation info of this paper to research management softwares

New Related Papers

Iran Scientific Advertisment Netword

Share this paper

WHAT IS COI?

COI is a national code dedicated to all Iranian Conference and Journal Papers. the COI of each paper can be verified online.