A HEURISTIC APPROACH BASED ON TABU SEARCH FOR EARLY/TARDY FLEXIBLE JOB SHOP PROBLEMS

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.

IMANIPOUR N.; ZEGORDI S.H.A.D.

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

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2006 | Volume:13 | Issue:1 Page(s): 1-13

Download Full-Text

View:

423

Download:

130

Cites:

Information Journal Paper

Title

A HEURISTIC APPROACH BASED ON TABU SEARCH FOR EARLY/TARDY FLEXIBLE JOB SHOP PROBLEMS

Author(s)

IMANIPOUR N. | ZEGORDI S.H.A.D. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

This paper addresses minimizing Total Weighted Earliness/Tardiness (TWET) of jobs in a Flexible Job Shop (FJS) problem. The FJS problem is an extension of the classical Job Shop (JS) problem that implies each operation may be assigned to alternative available machines. So, a job may have alternative routing. The FJS problem with a TWET criterion is modeled as a mixed integer programming. The model is proven to be Np-complete. To solve the model, an algorithm, based on a Tabu Search approach (TS), is developed. The proposed algorithm employs TS to find the best routing of each job and a backward procedure to operations scheduling. Two neighboring functions are designed and their effect is investigated on the performance. The numerical experiments show the suggested algorithm efficiently solves the model in a reasonable CPU time.

Cites

No record.

References

No record.

Cite

APA: Copy

IMANIPOUR, N., & ZEGORDI, S.H.A.D.. (2006). A HEURISTIC APPROACH BASED ON TABU SEARCH FOR EARLY/TARDY FLEXIBLE JOB SHOP PROBLEMS. SCIENTIA IRANICA, 13(1), 1-13. SID. https://sid.ir/paper/289324/en

Vancouver: Copy

IMANIPOUR N., ZEGORDI S.H.A.D.. A HEURISTIC APPROACH BASED ON TABU SEARCH FOR EARLY/TARDY FLEXIBLE JOB SHOP PROBLEMS. SCIENTIA IRANICA[Internet]. 2006;13(1):1-13. Available from: https://sid.ir/paper/289324/en

IEEE: Copy

N. IMANIPOUR, and S.H.A.D. ZEGORDI, “A HEURISTIC APPROACH BASED ON TABU SEARCH FOR EARLY/TARDY FLEXIBLE JOB SHOP PROBLEMS,” SCIENTIA IRANICA, vol. 13, no. 1, pp. 1–13, 2006, [Online]. Available: https://sid.ir/paper/289324/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops