An Application On Flowshop Scheduling

Sündüz Dağ

Alphanumeric Journal, 2013, vol. 1, issue 1, 47-56

Abstract: Flow shop scheduling problem has been well known as a research field for fifty years. In recent years, researchers have suggested many heuristic procedures to solve this type of problems. Most of these proposed algorithms in flow shop literature were applied to the benchmark problems. Few studies in flow shop literature include a real production application. The aim of this paper is to apply scheduling activity in a real flow shop production line. A cable production line is choosen for the application. All of the jobs are processed with same order which is named as permutational environment. The production line which is composed of eight different machines produces twelve kinds of cable. In other words, the problem size is 12 jobs x 8 machines. The objective of this problem focuses on minimizing total completion time and makespan. An ant colony algorithm is proposed to solve the problem. By changing initial solution of the algorithm, effect on objective function was monitored.

Keywords: Ant Colony; Flowshop; Real Production Environment; Scheduling (search for similar items in EconPapers)
JEL-codes: C44 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.alphanumericjournal.com/media/Issue/vo ... wshop-scheduling.pdf (application/pdf)
https://alphanumericjournal.com/article/an-application-on-flowshop-scheduling/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:anm:alpnmr:v:1:y:2013:i:1:p:47-56

Access Statistics for this article

More articles in Alphanumeric Journal from Bahadir Fatih Yildirim
Bibliographic data for series maintained by Bahadir Fatih Yildirim ().