NEW FORMULATION AND SOLUTION IN PCB ASSEMBLY SYSTEMS WITH PARALLEL BATCH PROCESSORS

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.

RASTGAR IMAN; SAHRAEIAN RASHED

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

Journal Paper

Paper Information

Journal: JOURNAL OF QUALITY ENGINEERING AND PRODUCTION OPTIMIZATIO Year:2017 | Volume:2 | Issue:1 Page(s): 27-46

Download Full-Text

View:

169

Download:

164

Cites:

Information Journal Paper

Title

NEW FORMULATION AND SOLUTION IN PCB ASSEMBLY SYSTEMS WITH PARALLEL BATCH PROCESSORS

Author(s)

RASTGAR IMAN | SAHRAEIAN RASHED | Issue Writer Certificate

Keywords

BATCH PROCESSING

HARMONY SEARCH ALGORITHM

SCHEDULING

TAGUCHI DESIGN OF EXPERIMENTS

PARALLEL MACHINE

Abstract

This paper considers the SCHEDULING problem of parallel BATCH PROCESSING machines with nonidentical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-inspired computational intelligent algorithms have been successfully employed to achieve the optimum design of different structures. Since the proposed model is NP-hard, a metaheuristic algorithm according to a HARMONY SEARCH ALGORITHM is developed and analyzed for solving the BATCH PROCESSING machine SCHEDULING problem addressed in the current paper. Various parameters and operators of the proposed HARMONY SEARCH ALGORITHM are discussed and calibrated by means of the Taguchi statistical technique. In order to evaluate the proposed algorithm, instance problems in concordance with previous research are generated. The proposed algorithm and basic harmony search, improved harmony search and global best harmony search are solved and the results of all the algorithms are compared. The conclusion reveals that the proposed algorithm performs better than the other algorithms.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

RASTGAR, IMAN, & SAHRAEIAN, RASHED. (2017). NEW FORMULATION AND SOLUTION IN PCB ASSEMBLY SYSTEMS WITH PARALLEL BATCH PROCESSORS. JOURNAL OF QUALITY ENGINEERING AND PRODUCTION OPTIMIZATIO, 2(1), 27-46. SID. https://sid.ir/paper/352190/en

Vancouver: Copy

RASTGAR IMAN, SAHRAEIAN RASHED. NEW FORMULATION AND SOLUTION IN PCB ASSEMBLY SYSTEMS WITH PARALLEL BATCH PROCESSORS. JOURNAL OF QUALITY ENGINEERING AND PRODUCTION OPTIMIZATIO[Internet]. 2017;2(1):27-46. Available from: https://sid.ir/paper/352190/en

IEEE: Copy

IMAN RASTGAR, and RASHED SAHRAEIAN, “NEW FORMULATION AND SOLUTION IN PCB ASSEMBLY SYSTEMS WITH PARALLEL BATCH PROCESSORS,” JOURNAL OF QUALITY ENGINEERING AND PRODUCTION OPTIMIZATIO, vol. 2, no. 1, pp. 27–46, 2017, [Online]. Available: https://sid.ir/paper/352190/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops