THE FINITE HORIZON ECONOMICLOT SCHEDULING IN FLEXIBLE FLOW LINES

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.

TORABI S.A.; FATEMI GHOMI S.M.T.; KARIMI B.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2005 | Volume:18 | Issue:3 Page(s): 273-284

Download Full-Text

View:

255

Download:

149

Cites:

Information Journal Paper

Title

THE FINITE HORIZON ECONOMICLOT SCHEDULING IN FLEXIBLE FLOW LINES

Author(s)

TORABI S.A. | FATEMI GHOMI S.M.T. | KARIMI B. | Issue Writer Certificate

Keywords

LOT-SCHEDULING

FLEXIBLE FLOW LINE

COMMON CYCLE APPROACH

FINITE HORIZON

Abstract

This paper addresses the common cycle multi-product LOT-SCHEDULING problem in FLEXIBLE FLOW LINEs (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unit while satisfying the demands without backlogging. This problem consists of a combinatorial part (machine assignment and sequencing sub-problems) and a continuous part (lot sizing and scheduling sub-problems). To account for these two elements, a new mixed integer nonlinear program (MINLP) is developed which simultaneously determines machine allocation, sequencing, lot-sizing and scheduling decisions. In order to reduce computational complexity, instead of solving this MINLP directly, we propose an efficient enumeration method to determine optimal solution of the model. Moreover, the performance of the proposed method is evaluated by some numerical experiments. Two other applicable cases (zero setup costs and Lot streaming) are studied and required modifications in the model formulation and the solution method are described. Finally, a case example in a PCS assembly system is presented to illustrate applicability of the mathematical model and the proposed solution method.

Cites

No record.

References

No record.

Cite

APA: Copy

TORABI, S.A., FATEMI GHOMI, S.M.T., & KARIMI, B.. (2005). THE FINITE HORIZON ECONOMICLOT SCHEDULING IN FLEXIBLE FLOW LINES. INTERNATIONAL JOURNAL OF ENGINEERING, 18(3), 273-284. SID. https://sid.ir/paper/355559/en

Vancouver: Copy

TORABI S.A., FATEMI GHOMI S.M.T., KARIMI B.. THE FINITE HORIZON ECONOMICLOT SCHEDULING IN FLEXIBLE FLOW LINES. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2005;18(3):273-284. Available from: https://sid.ir/paper/355559/en

IEEE: Copy

S.A. TORABI, S.M.T. FATEMI GHOMI, and B. KARIMI, “THE FINITE HORIZON ECONOMICLOT SCHEDULING IN FLEXIBLE FLOW LINES,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 18, no. 3, pp. 273–284, 2005, [Online]. Available: https://sid.ir/paper/355559/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops