Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

FATTAHI PARVIZ; MOHAMMADI ELHAM; Daneshamooz Fatemeh

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download Full-Text

Persian Verion

View:

442

Download:

Cites:

Information Journal Paper

Title

Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming

Author(s)

FATTAHI PARVIZ | MOHAMMADI ELHAM | Daneshamooz Fatemeh | Issue Writer Certificate

Keywords

SchedulingQ1

Job ShopQ1

AssemblyQ1

Lot StreamingQ1

Harmony SearchQ1

Abstract

In this research a multi-objective Job Shop Scheduling problem with an Assembly stage and Lot Streaming is studied. Lot Streaming (LS) technique is a process in which a job (lot) is splitted into smaller jobs (sub-lots) such that successive operations can be overlapped. The aim of this study is to schedule and sequence operations in order to meet constraints and minimize the makespan and total weighted earliness and tardiness penalties which, in turn, leads to decrease time and costs and achieve more effective management in industrial departments. First, a mixed integer linear programming model is presented. Since this problem is classified as NP-hard, a metaheuristic algorithm based on Harmony Search is proposed to solve the problem. In order to verify the effectiveness of the proposed algorithm, several performance measures are used. Computational results revealed that the proposed algorithm outperforms non-dominated sorting Genetic algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

FATTAHI, PARVIZ, MOHAMMADI, ELHAM, & Daneshamooz, Fatemeh. (2019). Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming. JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP), 9(33 ), 61-86. SID. https://sid.ir/paper/240991/en

Vancouver: Copy

FATTAHI PARVIZ, MOHAMMADI ELHAM, Daneshamooz Fatemeh. Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming. JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP)[Internet]. 2019;9(33 ):61-86. Available from: https://sid.ir/paper/240991/en

IEEE: Copy

PARVIZ FATTAHI, ELHAM MOHAMMADI, and Fatemeh Daneshamooz, “Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming,” JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP), vol. 9, no. 33 , pp. 61–86, 2019, [Online]. Available: https://sid.ir/paper/240991/en

Related Journal Papers