Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariappan Kadarkarainadar Marichelvam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j13]M. K. Marichelvam
, M. Geetha, Ömür Tosun:
An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - A case study. Comput. Oper. Res. 114 (2020)- [j12]Ömür Tosun, M. K. Marichelvam, Nedret Tosun:
A literature review on hybrid flow shop scheduling. Int. J. Adv. Oper. Manag. 12(2): 156-194 (2020) - 2018
- [j11]M. K. Marichelvam, P. Manimaran, M. Geetha:
Solving flexible job shop scheduling problems using a hybrid lion optimisation algorithm. Int. J. Adv. Oper. Manag. 10(2): 91-108 (2018) - [j10]M. K. Marichelvam, M. Geetha:
A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment. Int. J. Comput. Aided Eng. Technol. 10(6): 636-649 (2018) - 2017
- [j9]M. K. Marichelvam, Ömür Tosun, M. Geetha:
Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl. Soft Comput. 55: 82-92 (2017) - [j8]M. K. Marichelvam, A. Azhagurajan, M. Geetha:
A hybrid fruit fly optimisation algorithm to solve the flow shop scheduling problems with multi-objectives. Int. J. Adv. Intell. Paradigms 9(2/3): 164-185 (2017) - 2016
- [j7]M. K. Marichelvam, M. Geetha:
A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time. Int. J. Bio Inspired Comput. 8(5): 318-325 (2016) - [j6]Ömür Tosun, M. K. Marichelvam:
Hybrid bat algorithm for flow shop scheduling problems. Int. J. Math. Oper. Res. 9(1): 125-138 (2016) - [j5]M. K. Marichelvam, Ömür Tosun:
Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion. Int. J. Swarm Intell. Res. 7(2): 1-14 (2016) - 2014
- [j4]M. K. Marichelvam, Thirumoorthy Prabaharan, Xin-She Yang:
Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl. Soft Comput. 19: 93-101 (2014) - [j3]M. K. Marichelvam, M. Geetha:
Solving tri-objective multistage hybrid flow shop scheduling problems using a discrete firefly algorithm. Int. J. Intell. Eng. Informatics 2(4): 284-303 (2014) - [j2]Mariappan Kadarkarainadar Marichelvam, Thirumoorthy Prabaharan, Xin-She Yang:
A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems. IEEE Trans. Evol. Comput. 18(2): 301-305 (2014) - 2012
- [j1]M. K. Marichelvam:
An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems. Int. J. Bio Inspired Comput. 4(4): 200-205 (2012)
Parts in Books or Collections
- 2015
- [p1]M. K. Marichelvam, Thirumoorthy Prabaharan, M. Geetha:
Firefly Algorithm for Flow Shop Optimization. Recent Advances in Swarm Intelligence and Evolutionary Computation 2015: 225-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
