EUVIMEDEUVIMED entdecken
Crossref

Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs

SATHIYA SHANTHI R, MEGANATHAN R, JAYAKUMAR S, VIJAYARAGAVAN R

Journal of Computational Mathematica · 2021

DOI: 10.26524/cm102 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computational Mathematica, 2021. Verfasst von SATHIYA SHANTHI R und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Scheduling process arises naturally upon availability of resources through a systematic approach in which prior planning and decisions should be made. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954 with makespan minimization as objective. Earlier we proposed two algorithms for the makespan objective; in this paper we intend to investigate the same algorithms for the objective of Total Completion Time of all the jobs (TCT). Experimental results had shown that one of our algorithms gives better results than the other two when the machine order is reversed.

Zitieren

APA

R, S. S., R, M., S, J., & R, V. (2021). Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs. Journal of Computational Mathematica. https://doi.org/10.26524/cm102

Vancouver

R SS, R M, S J, R V. Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs. Journal of Computational Mathematica. 2021. doi:10.26524/cm102

BibTeX
@article{R2021,
  author = {R, SATHIYA SHANTHI and R, MEGANATHAN and S, JAYAKUMAR and R, VIJAYARAGAVAN},
  title = {Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs},
  journal = {Journal of Computational Mathematica},
  year = {2021},
  doi = {10.26524/cm102}
}
Kostenlos starten →