A CLOUD-BASED SIMULATED ANNEALING ALGORITHM FOR ORDER ACCEPTANCE PROBLEM WITH WEIGHTED TARDINESS PENALTIES IN PERMUTATION FLOW SHOP SCHEDULING

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.

ASGARI TEHRANI M.M.; ZANDIEH M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS) Year:2014 | Volume:1 | Issue:1 Page(s): 1-19

Download Full-Text

View:

413

Download:

Cites:

Information Journal Paper

Title

A CLOUD-BASED SIMULATED ANNEALING ALGORITHM FOR ORDER ACCEPTANCE PROBLEM WITH WEIGHTED TARDINESS PENALTIES IN PERMUTATION FLOW SHOP SCHEDULING

Author(s)

ASGARI TEHRANI M.M. | ZANDIEH M. | Issue Writer Certificate

Keywords

PERMUTATION FLOW SHOP SCHEDULING

ORDER ACCEPTANCE

WEIGHTED TARDINESS

CLOUD

BASED SIMULATED ANNEALING ALGORITHM

MAKE

ORDER PRODUCTION STRATEGY

Abstract

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the ORDER ACCEPTANCE problem with WEIGHTED TARDINESS penalties in PERMUTATION FLOW SHOP SCHEDULING with MTO production strategy, the objective function of which is TO maximize the TOtal net profit of the accepted orders. The problem is formulated as an integer-programming (IP) model, and a CLOUD-based simulated annealing (CSA) algorithm is developed TO solve the problem. Based on the number of candidate orders the firm receives, fifteen problems are generated. Each problem is regarded as an experiment, which is conducted five times TO compare the efficiency of the proposed CSA algorithm TO the one of simulated annealing (SA) algorithm previously suggested for the problem. The experimental results testify TO the improvement in objective function values yielded by CSA algorithm in comparison with the ones produced by the formerly proposed SA algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

ASGARI TEHRANI, M.M., & ZANDIEH, M.. (2014). A CLOUD-BASED SIMULATED ANNEALING ALGORITHM FOR ORDER ACCEPTANCE PROBLEM WITH WEIGHTED TARDINESS PENALTIES IN PERMUTATION FLOW SHOP SCHEDULING. JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS), 1(1), 1-19. SID. https://sid.ir/paper/345033/en

Vancouver: Copy

ASGARI TEHRANI M.M., ZANDIEH M.. A CLOUD-BASED SIMULATED ANNEALING ALGORITHM FOR ORDER ACCEPTANCE PROBLEM WITH WEIGHTED TARDINESS PENALTIES IN PERMUTATION FLOW SHOP SCHEDULING. JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS)[Internet]. 2014;1(1):1-19. Available from: https://sid.ir/paper/345033/en

IEEE: Copy

M.M. ASGARI TEHRANI, and M. ZANDIEH, “A CLOUD-BASED SIMULATED ANNEALING ALGORITHM FOR ORDER ACCEPTANCE PROBLEM WITH WEIGHTED TARDINESS PENALTIES IN PERMUTATION FLOW SHOP SCHEDULING,” JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS), vol. 1, no. 1, pp. 1–19, 2014, [Online]. Available: https://sid.ir/paper/345033/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops