DEVELOPING AN EFFICIENT HEURISTIC FOR JOB SHOP SCHEDULING PROBLEM CONSIDERING UNCERTAINTIES

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.

RABANI M.; TAVAKOLI MOGHADAM R.; MOHAMMADIPOUR M.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2004 | Volume:15 | Issue:1 Page(s): 27-42

Download Full-Text

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

Persian Verion

View:

1,381

Download:

Cites:

Information Journal Paper

Title

DEVELOPING AN EFFICIENT HEURISTIC FOR JOB SHOP SCHEDULING PROBLEM CONSIDERING UNCERTAINTIES

Author(s)

RABANI M. | TAVAKOLI MOGHADAM R. | MOHAMMADIPOUR M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, a comprehensive model is developed for job-shop scheduling problems using fuzzy methodology and concepts. Processing time are considered as fuzzy numbers, and shifting bottleneck is applied and modified as an effective heuristic in solving such problems. In developed method, a heuristic algorithm is used for optimization sub-problem. This algorithm is applied for single machine scheduling problem (1׀rj׀Lmax) when release time of jobs is considered and the goal is minimization of lateness. All processing times, due dates, and release times are uncertain and they are shown by fuzzy numbers.Since 1׀rj׀Lmax is known as an NP-hard problem, the developed heuristic shows acceptable results. Solved numerical examples at the end of this study prove the capability of the developed heuristic in shifting bottleneck algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

RABANI, M., TAVAKOLI MOGHADAM, R., & MOHAMMADIPOUR, M.. (2004). DEVELOPING AN EFFICIENT HEURISTIC FOR JOB SHOP SCHEDULING PROBLEM CONSIDERING UNCERTAINTIES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 15(1), 27-42. SID. https://sid.ir/paper/65799/en

Vancouver: Copy

RABANI M., TAVAKOLI MOGHADAM R., MOHAMMADIPOUR M.. DEVELOPING AN EFFICIENT HEURISTIC FOR JOB SHOP SCHEDULING PROBLEM CONSIDERING UNCERTAINTIES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2004;15(1):27-42. Available from: https://sid.ir/paper/65799/en

IEEE: Copy

M. RABANI, R. TAVAKOLI MOGHADAM, and M. MOHAMMADIPOUR, “DEVELOPING AN EFFICIENT HEURISTIC FOR JOB SHOP SCHEDULING PROBLEM CONSIDERING UNCERTAINTIES,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 15, no. 1, pp. 27–42, 2004, [Online]. Available: https://sid.ir/paper/65799/en

Related Journal Papers