A modified branch and bound algorithm for a vague ow-shop scheduling problem

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.

GHOLIZADEH H.; FAZLOLLAHTABAR H.; GHOLIZADEH R.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2019 | Volume:16 | Issue:4 Page(s): 55-64

Download Full-Text

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

Persian Verion

View:

558

Download:

222

Cites:

Information Journal Paper

Title

A modified branch and bound algorithm for a vague ow-shop scheduling problem

Author(s)

GHOLIZADEH H. | FAZLOLLAHTABAR H. | GHOLIZADEH R. | Issue Writer Certificate

Keywords

Flow-shop schedulingQ2

branch and boundQ2

octagonal vague numbersQ2

ranking methodsQ2

Abstract

Uncertainty plays a signicant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another denition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on distance is used to model a ow-shop scheduling problem being an important problem in assembly production systems. The vagueness being used as octagon numbers are employed to represent vague processes for the manufacturing system. As a modeling effort, first a ow-shop scheduling problem is handled with vagueness. Then, for solving and analyzing the proposed vague ow-shop scheduling model, a modified branch and bound algorithm is proposed. As an implementation, an example is used to explain the performance and to analyze the sensitivity of the proposed vague approach. The validity of the proposed model and modified algorithm is demonstrated through a robust ranking technique. The outputs help the decision makers to counteract the vagueness and handle operational decisions in ow-shop scheduling problems within dynamic environments.

Cites

No record.

References

No record.

Cite

APA: Copy

GHOLIZADEH, H., FAZLOLLAHTABAR, H., & GHOLIZADEH, R.. (2019). A modified branch and bound algorithm for a vague ow-shop scheduling problem. IRANIAN JOURNAL OF FUZZY SYSTEMS, 16(4 ), 55-64. SID. https://sid.ir/paper/113443/en

Vancouver: Copy

GHOLIZADEH H., FAZLOLLAHTABAR H., GHOLIZADEH R.. A modified branch and bound algorithm for a vague ow-shop scheduling problem. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2019;16(4 ):55-64. Available from: https://sid.ir/paper/113443/en

IEEE: Copy

H. GHOLIZADEH, H. FAZLOLLAHTABAR, and R. GHOLIZADEH, “A modified branch and bound algorithm for a vague ow-shop scheduling problem,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 16, no. 4 , pp. 55–64, 2019, [Online]. Available: https://sid.ir/paper/113443/en

Related Journal Papers