A NEW HEURISTIC METHOD BASED ON CPM IN SALBP

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.

FATHI M.; JAHAN A.; ARIFFIN M.K.A.; ISMAIL N.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2011 | Volume:7 | Issue:13 Page(s): 1-11

Download Full-Text

View:

504

Download:

156

Cites:

Information Journal Paper

Title

A NEW HEURISTIC METHOD BASED ON CPM IN SALBP

Author(s)

FATHI M. | JAHAN A. | ARIFFIN M.K.A. | ISMAIL N. | Issue Writer Certificate

Keywords

ASSEMBLY LINE BALANCING PROBLEM

CRITICAL PATH METHOD

HEURISTIC METHOD

Abstract

The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing HEURISTIC METHODs for these problems is totally unquestionable. Furthermore, in line with balancing problems, HEURISTIC METHODs are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient HEURISTIC METHODs. This paper presents a new HEURISTIC METHOD based on the famous CRITICAL PATH METHOD (CPM) for the simple ASSEMBLY LINE BALANCING PROBLEM (SALBP) that the only precedence constraints between tasks and cycle time have been considered. In this research regarding the objectives of minimizing the number of workstation, maximizing smoothness index and maximizing line performance, the efficiency of the suggested method and 11 popular methods are compared at SALBP-1. For comparative evaluation, 11 networks are collected from open literature, and are used with different cycle times. On the whole, 40 problems have been solved and it is found that the HEURISTIC METHOD based on critical path is more efficient than the others.

Cites

A SIMPLE APPROACH TO THE TWO-DIMENSIONAL GUILLOTINE CUTTING STOCK PROBLEM

References

No record.

Cite

APA: Copy

FATHI, M., JAHAN, A., ARIFFIN, M.K.A., & ISMAIL, N.. (2011). A NEW HEURISTIC METHOD BASED ON CPM IN SALBP. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 7(13), 1-11. SID. https://sid.ir/paper/309867/en

Vancouver: Copy

FATHI M., JAHAN A., ARIFFIN M.K.A., ISMAIL N.. A NEW HEURISTIC METHOD BASED ON CPM IN SALBP. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2011;7(13):1-11. Available from: https://sid.ir/paper/309867/en

IEEE: Copy

M. FATHI, A. JAHAN, M.K.A. ARIFFIN, and N. ISMAIL, “A NEW HEURISTIC METHOD BASED ON CPM IN SALBP,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 7, no. 13, pp. 1–11, 2011, [Online]. Available: https://sid.ir/paper/309867/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops