SEEKING SIMULATION-BASED OPTIMIZATION OF JOB SHOP SCHEDULING IN SMALL AND MEDIUM ENTERPRISES TO MINIMIZE THE COST OF TARDINESS AND EARLINESS OF ACTIVITIES

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.

SAJADI SEYED MOJTABA; SHAHBAZI SADEGH

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

Journal Paper

Paper Information

Journal: Industrial Management Journal Year:2017 | Volume:9 | Issue:1 Page(s): 129-146

Download Full-Text

Persian Verion

View:

842

Download:

Cites:

Information Journal Paper

Title

SEEKING SIMULATION-BASED OPTIMIZATION OF JOB SHOP SCHEDULING IN SMALL AND MEDIUM ENTERPRISES TO MINIMIZE THE COST OF TARDINESS AND EARLINESS OF ACTIVITIES

Author(s)

SAJADI SEYED MOJTABA | SHAHBAZI SADEGH | Issue Writer Certificate

Keywords

COST OF TARDINESS AND EARLINESSQ2

JOB SHOPQ1

OPTIMIZATIONQ2

QUEUEQ2

SIMULATIONQ1

Abstract

Determining the optimal sequence of jobs in JOB SHOP scheduling for small and medium enterprises, affect the machine productivity, earliness and tardiness costs of delivery. The deterministic variant of the problem is well-known to be NP-Hard. If random elements are introduced into the problem, the level of complexity goes higher. Hence, many priority rules have been developed to tackle stochastic JOB SHOP scheduling problem. However, to devise a better solution approach, SIMULATION-optimization approach might be used. In this study, a mathematical model was developed for JOB SHOP scheduling with random process times and possible machine breakdowns. Then, a SIMULATION-optimization model was applied to choose among a list of priority rules using Rockwell Arena 14. Finally, a numerical example was used to evaluate the quality of the model. Results showed that the rule Longest Processing Time (LPT) yields the lowest total earliness and tardiness costs.However, the total costs of the following rules are also acceptable: First in First out (FIFO), Last in First out (LIFO), Earliest Due Date (EDD) and Slack time (Slack).

Cites

No record.

References

No record.

Cite

APA: Copy

SAJADI, SEYED MOJTABA, & SHAHBAZI, SADEGH. (2017). SEEKING SIMULATION-BASED OPTIMIZATION OF JOB SHOP SCHEDULING IN SMALL AND MEDIUM ENTERPRISES TO MINIMIZE THE COST OF TARDINESS AND EARLINESS OF ACTIVITIES. JOURNAL OF INDUSTRIAL MANAGEMENT, 9(1 ), 129-146. SID. https://sid.ir/paper/140012/en

Vancouver: Copy

SAJADI SEYED MOJTABA, SHAHBAZI SADEGH. SEEKING SIMULATION-BASED OPTIMIZATION OF JOB SHOP SCHEDULING IN SMALL AND MEDIUM ENTERPRISES TO MINIMIZE THE COST OF TARDINESS AND EARLINESS OF ACTIVITIES. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2017;9(1 ):129-146. Available from: https://sid.ir/paper/140012/en

IEEE: Copy

SEYED MOJTABA SAJADI, and SADEGH SHAHBAZI, “SEEKING SIMULATION-BASED OPTIMIZATION OF JOB SHOP SCHEDULING IN SMALL AND MEDIUM ENTERPRISES TO MINIMIZE THE COST OF TARDINESS AND EARLINESS OF ACTIVITIES,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 9, no. 1 , pp. 129–146, 2017, [Online]. Available: https://sid.ir/paper/140012/en

Related Journal Papers