MODELING AND SOLVING JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES

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.

BEHROOZI MAHDI; ESHGHI KOUROSH

مرکز اطلاعات علمی 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) Year:2011 | Volume:21 | Issue:4 Page(s): 102-115

Download Full-Text

Persian Verion

View:

1,706

Download:

Cites:

Information Journal Paper

Title

MODELING AND SOLVING JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES

Author(s)

BEHROOZI MAHDI | ESHGHI KOUROSH | Issue Writer Certificate

Keywords

JOB SHOP SCHEDULINGQ2

INSEPARABLE SEQUENCE DEPENDENT SETUP TIMESQ2

PARTICLE SWARM OPTIMIZATION (PSO)Q2

FACTORADICQ2

SIMULATED ANNEALING (SA)Q3

GRASPQ2

Abstract

In recent decade, many researches has been done on JOB SHOP SCHEDULING problem with sequence dependent setup times (SDSJSP), but with respect to the knowledge of authors in very few of them the assumption of existing inseparable setup has been considered. Also, in attracted metaheuristic algorithms to this problem the Particle Swarm Optimization has not been considered. In this paper, the ISDSJSP with makespan minimization is considered. For this problem an MILP model has been developed and a PSO algorithm has been applied to solve it. In order to improve final solution obtained by PSO a simulated annealing algorithm has been applied. The proposed hybrid algorithm (HPSO) has been applied on some generated benchmark problems and the results indicate the effectiveness and efficiency of the proposed hybrid PSO with respect to two other algorithms.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

BEHROOZI, MAHDI, & ESHGHI, KOUROSH. (2011). MODELING AND SOLVING JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 21(4), 102-115. SID. https://sid.ir/paper/65828/en

Vancouver: Copy

BEHROOZI MAHDI, ESHGHI KOUROSH. MODELING AND SOLVING JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2011;21(4):102-115. Available from: https://sid.ir/paper/65828/en

IEEE: Copy

MAHDI BEHROOZI, and KOUROSH ESHGHI, “MODELING AND SOLVING JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 21, no. 4, pp. 102–115, 2011, [Online]. Available: https://sid.ir/paper/65828/en

Related Journal Papers