default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamran Kianfar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Maryam Younespour
, Majid Esmaelian, Kamran Kianfar:
Optimizing the strategic and operational levels of demand-driven MRP using a hybrid GA-PSO algorithm. Comput. Ind. Eng. 193: 110306 (2024)- 2023
- [j11]Kamran Kianfar, Arezoo Atighehchian:
A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks. Ann. Oper. Res. 328(1): 727-754 (2023) - 2022
- [j10]Habibeh Amini, Kamran Kianfar:
A variable neighborhood search based algorithm and game theory models for green supply chain design. Appl. Soft Comput. 119: 108615 (2022) - [j9]Samaneh Esmaili, Kamran Kianfar:
Grid Scheduling Considering Energy Consumption Management and Quality of Service. J. Grid Comput. 20(3): 30 (2022) - 2021
- [j8]Hamidreza Ebrahimi, Kamran Kianfar, Mehdi Bijari:
Scheduling a cellular manufacturing system based on price elasticity of demand and time-dependent energy prices. Comput. Ind. Eng. 159: 107460 (2021) - 2020
- [j7]Arezoo Atighehchian, Mohammad Mehdi Sepehri, Pejman Shadpour, Kamran Kianfar:
A two-step stochastic approach for operating rooms scheduling in multi-resource environment. Ann. Oper. Res. 292(1): 191-214 (2020)
2010 – 2019
- 2019
- [j6]Kamran Kianfar:
Maximizing profit in a supply chain by considering advertising and price elasticity of demand. Comput. Ind. Eng. 135: 265-274 (2019) - 2015
- [j5]Kamran Kianfar, Ghasem Moslehi, Ramin Yahyapour:
A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems. J. Supercomput. 71(3): 1143-1162 (2015) - 2014
- [j4]Ghasem Moslehi, Kamran Kianfar:
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty. J. Appl. Math. 2014: 679702:1-679702:10 (2014) - 2013
- [j3]Kamran Kianfar, Ghasem Moslehi:
A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date". Discret. Appl. Math. 161(13-14): 2205-2206 (2013) - 2012
- [j2]Kamran Kianfar, Ghasem Moslehi:
A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Oper. Res. 39(12): 2978-2990 (2012) - [j1]Kamran Kianfar, S. M. T. Fatemi Ghomi, A. Oroojlooy Jadid:
Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA. Eng. Appl. Artif. Intell. 25(3): 494-506 (2012) - 2010
- [c1]Amir Hassan Zadeh, Hamed Maleki, Kamran Kianfar, Mehdi Fathi, Mohammad Saeed Zaeri:
Catalog Segmentation by Implementing Fuzzy Clustering and Mathematical Programming Model. SOCO 2010: 161-169
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-10-07 22:11 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:
