A NEW HEURISTIC ALGORITHM FOR SOLVING JOB SHOP PROBLEM WITH COMBINING THE CRITICAL PATH AND RESOURCE ALLOCATION LIMITED

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.

KARGARI M.; REZAEI Z.; KHADEMI ZARE H.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH) Year:2006 | Volume:17 | Issue:2 Page(s): 43-47

Download Full-Text

View:

392

Download:

Cites:

Information Journal Paper

Title

A NEW HEURISTIC ALGORITHM FOR SOLVING JOB SHOP PROBLEM WITH COMBINING THE CRITICAL PATH AND RESOURCE ALLOCATION LIMITED

Author(s)

KARGARI M. | REZAEI Z. | KHADEMI ZARE H. | Issue Writer Certificate

Keywords

PRODUCTION SCHEDULING

TOTAL WEIGHTED TARDINESS

LIMITED RESOURCE ALLOCATION

CRITICAL PATH METHOD

JOB-SHOP PRODUCTION

Abstract

Determining a PRODUCTION SCHEDULING and LIMITED RESOURCE ALLOCATION in PRODUCTION SCHEDULING problems plays an important and effective role in manufacturing organizations since correct determination of the production schedule and LIMITED RESOURCE ALLOCATION leads to capital stack avoidance, losses reduction, machine idleness reduction or elimination and better use of them, supplying the customers orders and demands in time, and providing materials and parts. The objective of PRODUCTION SCHEDULING is to allocate limited resources to perform a set of competitor's activities. Having a proper production schedule significantly increases the performance and provides access to organizational goals. In this paper, job-shop PRODUCTION SCHEDULING problems with LIMITED RESOURCE ALLOCATION in each stage and minimizing the TOTAL WEIGHTED TARDINESS have been studied and die PRODUCTION SCHEDULING have been determined through a combinational algorithm of critical path and LIMITED RESOURCE ALLOCATION methods. Finally, effectiveness of the proposed algorithm in comparison to other methods has been verified through several instances.

Cites

No record.

References

No record.

Cite

APA: Copy

KARGARI, M., REZAEI, Z., & KHADEMI ZARE, H.. (2006). A NEW HEURISTIC ALGORITHM FOR SOLVING JOB SHOP PROBLEM WITH COMBINING THE CRITICAL PATH AND RESOURCE ALLOCATION LIMITED. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), 17(2), 43-47. SID. https://sid.ir/paper/583917/en

Vancouver: Copy

KARGARI M., REZAEI Z., KHADEMI ZARE H.. A NEW HEURISTIC ALGORITHM FOR SOLVING JOB SHOP PROBLEM WITH COMBINING THE CRITICAL PATH AND RESOURCE ALLOCATION LIMITED. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH)[Internet]. 2006;17(2):43-47. Available from: https://sid.ir/paper/583917/en

IEEE: Copy

M. KARGARI, Z. REZAEI, and H. KHADEMI ZARE, “A NEW HEURISTIC ALGORITHM FOR SOLVING JOB SHOP PROBLEM WITH COMBINING THE CRITICAL PATH AND RESOURCE ALLOCATION LIMITED,” INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), vol. 17, no. 2, pp. 43–47, 2006, [Online]. Available: https://sid.ir/paper/583917/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops