FLOW SHOP SCHEDULING PROBLEM WITH MINIMIZING EARLINESS/TARDINESS CRITERIA

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.

JOULAEI F.; MOATAR HOSSEINI S.M.; HASAN HOSSEINI S.M.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2004 | Volume:15 | Issue:58-D Page(s): 452-461

Download Full-Text

Persian Verion

View:

1,012

Download:

Cites:

Information Journal Paper

Title

FLOW SHOP SCHEDULING PROBLEM WITH MINIMIZING EARLINESS/TARDINESS CRITERIA

Author(s)

JOULAEI F. | MOATAR HOSSEINI S.M. | HASAN HOSSEINI S.M. | Issue Writer Certificate

Keywords

GENETIC ALGORITHMQ4

PERMUTATION FLOW SHOP EARLINESSQ2

TARDINESS CRITERIAQ4

Abstract

In this paper, we consider a permutation flow shop scheduling problems with n jobs and m machines. The jobs have arbitrary processing times and due dates. Our objective is minimizing the total earliness and tardiness of all jobs. We develop a GENETIC ALGORITHM to solve this problem. The performance of the algorithm is evaluated through computational experiments.

Cites

No record.

References

No record.

Cite

APA: Copy

JOULAEI, F., MOATAR HOSSEINI, S.M., & HASAN HOSSEINI, S.M.. (2004). FLOW SHOP SCHEDULING PROBLEM WITH MINIMIZING EARLINESS/TARDINESS CRITERIA. AMIRKABIR, 15(58-D), 452-461. SID. https://sid.ir/paper/844/en

Vancouver: Copy

JOULAEI F., MOATAR HOSSEINI S.M., HASAN HOSSEINI S.M.. FLOW SHOP SCHEDULING PROBLEM WITH MINIMIZING EARLINESS/TARDINESS CRITERIA. AMIRKABIR[Internet]. 2004;15(58-D):452-461. Available from: https://sid.ir/paper/844/en

IEEE: Copy

F. JOULAEI, S.M. MOATAR HOSSEINI, and S.M. HASAN HOSSEINI, “FLOW SHOP SCHEDULING PROBLEM WITH MINIMIZING EARLINESS/TARDINESS CRITERIA,” AMIRKABIR, vol. 15, no. 58-D, pp. 452–461, 2004, [Online]. Available: https://sid.ir/paper/844/en

Related Journal Papers