SOLVING A FLOW SHOP SCHEDULING PROBLEM WITH UNCERTAIN PROCESSING TIME AND STOCHASTIC DUE DATE BY FUZZY LOGIC AND POSSIBILITY THEORY

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.

TAVAKOLI MOGHADAM R.; RAZMI J.; JOULAEI F.; SAFARI M.

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

Journal Paper

Paper Information

Journal: Year:2006 | Volume:40 | Issue:4 (98) Page(s): 477-486

Download Full-Text

Persian Verion

View:

1,094

Download:

Cites:

Information Journal Paper

Title

SOLVING A FLOW SHOP SCHEDULING PROBLEM WITH UNCERTAIN PROCESSING TIME AND STOCHASTIC DUE DATE BY FUZZY LOGIC AND POSSIBILITY THEORY

Author(s)

TAVAKOLI MOGHADAM R. | RAZMI J. | JOULAEI F. | SAFARI M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, a stochastic and uncertain flow shop scheduling problem is considered. Processing times are not known exactly, so they are estimated as intervals. Thus, the processing time of job i on machine j is a fuzzy set that is the possibility distribution of the processing time. Due date is a random variable defined for make span. In certain models, there are two major criteria; make span and lateness. In stochastic models, they are expected value of make span and lateness probability. The main problem in stochastic flow shops is to estimate the criteria that exactly defined. In this study, we will consider the probability of lateness fuzzy event. We demonstrate a mathematical method for evaluating the criteria. Finally, a near-optimal solution as a sequence will be obtained by a heuristic method.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., RAZMI, J., JOULAEI, F., & SAFARI, M.. (2006). SOLVING A FLOW SHOP SCHEDULING PROBLEM WITH UNCERTAIN PROCESSING TIME AND STOCHASTIC DUE DATE BY FUZZY LOGIC AND POSSIBILITY THEORY. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 40(4 (98)), 477-486. SID. https://sid.ir/paper/14249/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., RAZMI J., JOULAEI F., SAFARI M.. SOLVING A FLOW SHOP SCHEDULING PROBLEM WITH UNCERTAIN PROCESSING TIME AND STOCHASTIC DUE DATE BY FUZZY LOGIC AND POSSIBILITY THEORY. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2006;40(4 (98)):477-486. Available from: https://sid.ir/paper/14249/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, J. RAZMI, F. JOULAEI, and M. SAFARI, “SOLVING A FLOW SHOP SCHEDULING PROBLEM WITH UNCERTAIN PROCESSING TIME AND STOCHASTIC DUE DATE BY FUZZY LOGIC AND POSSIBILITY THEORY,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 40, no. 4 (98), pp. 477–486, 2006, [Online]. Available: https://sid.ir/paper/14249/en

Related Journal Papers