THE ECONOMIC LOT AND DELIVERY SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS

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: AMIRKABIR Year:2005 | Volume:16 | Issue:62-B Page(s): 83-91

Download Full-Text

View:

279

Download:

Cites:

Information Journal Paper

Title

THE ECONOMIC LOT AND DELIVERY SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS

Author(s)

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

Keywords

LOT AND DELIVERY SCHEDULING

FLEXIBLE JOB SHOP

COMMON CYCLE

SUPPLY CHAIN

FINITE HORIZON

Abstract

In this paper, we consider a typical SUPPLY CHAIN where a single supplier produces multiple components on a FLEXIBLE JOB SHOP (FJS) and delivers them directly to an assembly facility (AF). It is assumed that demand rates for these components are deterministic and constant over a finite planning horizon. The objective is to find a COMMON CYCLE lot production and delivery schedule that minimizes the average of holding, setup, and transportation costs per time unit for the SUPPLY CHAIN. This problem consists of a combinatorial part (machine assignment and sequencing sub-problems), and a continuous part (common cycle duration 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 the optimal solution of the model. The performance of the proposed method is evaluated by some numerical experiments. Another applicable case (Lot streaming) is also studied and required modifications in the model formulation and the solution procedure are described. Moreover, a numerical example is presented to illustrate applicability of the proposed mathematical models and the solution methods.

Cites

No record.

References

No record.

Cite

APA: Copy

TORABI, S.A., FATEMI GHOMI, S.M.T., & KARIMI, B.. (2005). THE ECONOMIC LOT AND DELIVERY SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS. AMIRKABIR, 16(62-B), 83-91. SID. https://sid.ir/paper/529413/en

Vancouver: Copy

TORABI S.A., FATEMI GHOMI S.M.T., KARIMI B.. THE ECONOMIC LOT AND DELIVERY SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS. AMIRKABIR[Internet]. 2005;16(62-B):83-91. Available from: https://sid.ir/paper/529413/en

IEEE: Copy

S.A. TORABI, S.M.T. FATEMI GHOMI, and B. KARIMI, “THE ECONOMIC LOT AND DELIVERY SCHEDULING PROBLEM IN FLEXIBLE JOB SHOPS,” AMIRKABIR, vol. 16, no. 62-B, pp. 83–91, 2005, [Online]. Available: https://sid.ir/paper/529413/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops