SCHEDULING OF MULTIPLE AUTONOMOUS GUIDED VEHICLES FOR AN ASSEMBLY LINE USING MINIMUM COST NETWORK FLOW

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.

FAZLOLLAHTABAR HAMED

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2018 | Volume:11 | Issue:1 (23) Page(s): 185-193

Download Full-Text

View:

203

Download:

151

Cites:

Information Journal Paper

Title

SCHEDULING OF MULTIPLE AUTONOMOUS GUIDED VEHICLES FOR AN ASSEMBLY LINE USING MINIMUM COST NETWORK FLOW

Author(s)

FAZLOLLAHTABAR HAMED | Issue Writer Certificate

Keywords

PARALLEL ASSEMBLY LINE

AUTONOMOUS GUIDED VEHICLE (AGV)

SCHEDULING

MINIMUM COST NETWORK FLOW

Abstract

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra-assembly line) and that among stations in different assembly lines (inter assembly line) are performed using AGVs. Scheduling of AGVs to service the assembly lines and the corresponding stations are proposed. In the proposed problem, the assignment of multiple AGVs to different assembly lines and stations is performed using minimum-cost network flow (MCF). It optimizes weighted completion time of tasks for each short-term window by formulating the task and resource assignment problem as MCF problem during each short-term scheduling window. The novelties of the paper are as follows: to configure an autonomous assembly line, to model a minimum cost network flow, and to develop a heuristic solution approach. The results and comparisons show the effectiveness and efficiency of the model and solution algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

FAZLOLLAHTABAR, HAMED. (2018). SCHEDULING OF MULTIPLE AUTONOMOUS GUIDED VEHICLES FOR AN ASSEMBLY LINE USING MINIMUM COST NETWORK FLOW. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 11(1 (23)), 185-193. SID. https://sid.ir/paper/713276/en

Vancouver: Copy

FAZLOLLAHTABAR HAMED. SCHEDULING OF MULTIPLE AUTONOMOUS GUIDED VEHICLES FOR AN ASSEMBLY LINE USING MINIMUM COST NETWORK FLOW. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2018;11(1 (23)):185-193. Available from: https://sid.ir/paper/713276/en

IEEE: Copy

HAMED FAZLOLLAHTABAR, “SCHEDULING OF MULTIPLE AUTONOMOUS GUIDED VEHICLES FOR AN ASSEMBLY LINE USING MINIMUM COST NETWORK FLOW,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 11, no. 1 (23), pp. 185–193, 2018, [Online]. Available: https://sid.ir/paper/713276/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops