MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION

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.

YOUSEFI YEGANEH B.; KHANLARZADE N.; RAHIMI FARD A.

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:2012 | Volume:22 | Issue:4 Page(s): 332-340

Download Full-Text

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

Persian Verion

View:

957

Download:

Cites:

Information Journal Paper

Title

MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION

Author(s)

YOUSEFI YEGANEH B. | KHANLARZADE N. | RAHIMI FARD A. | Issue Writer Certificate

Keywords

MEMETIC ALGORITHMQ2

FLEXIBLE JOB SHOP SCHEDULINGQ2

OVERLAPPINGQ2

PREEMPTIONQ2

Abstract

Flexible job shop scheduling problem )FJSP( is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set .FJSP is NP-hard and mainly presents two difficulties .The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines .However, it is quite difficult to achieve an optimal solution to this problem in medium and large size problems with traditional optimization approaches .In this paper a MEMETIC ALGORITHM (MA) or FLEXIBLE JOB SHOP SCHEDULING with OVERLAPPING in operation is proposed that solves the FJSP to minimize makespan time and obtain the optimum solution for small problem and best solution for medium and large scale problems .In this paper we also used PREEMPTION to improve the results of MEMETIC ALGORITHM and reduce the makespan.

Cites

No record.

References

No record.

Cite

APA: Copy

YOUSEFI YEGANEH, B., KHANLARZADE, N., & RAHIMI FARD, A.. (2012). MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 22(4), 332-340. SID. https://sid.ir/paper/65478/en

Vancouver: Copy

YOUSEFI YEGANEH B., KHANLARZADE N., RAHIMI FARD A.. MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2012;22(4):332-340. Available from: https://sid.ir/paper/65478/en

IEEE: Copy

B. YOUSEFI YEGANEH, N. KHANLARZADE, and A. RAHIMI FARD, “MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 22, no. 4, pp. 332–340, 2012, [Online]. Available: https://sid.ir/paper/65478/en

Related Journal Papers