default search action
Parviz Fattahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Mahdyeh Shiri, Parviz Fattahi
, Fatemeh Sogandi:
Two-stage approach for COVID-19 vaccine supply chain network under uncertainty using the machine learning algorithms: A case study. Eng. Appl. Artif. Intell. 135: 108837 (2024) - 2022
- [j17]Vahid Hajipour, Parviz Fattahi, Hasan Bagheri, Samaneh Babaei Morad:
Dynamic maximal covering location problem for fire stations under uncertainty: soft-computing approaches. Int. J. Syst. Assur. Eng. Manag. 13(1): 90-112 (2022) - 2021
- [j16]Parviz Fattahi, Vahid Hajipour, Sara Hajiloo:
A multi-objective parameter-tuned soft computing-based algorithm to optimize competitive congested location-pricing problem within multi-type service. Array 10: 100062 (2021) - [j15]Ehsan Molaee, Ramin Sadeghian, Parviz Fattahi:
Minimizing maximum tardiness on a single machine with family setup times and machine disruption. Comput. Oper. Res. 129: 105231 (2021) - [j14]Fatemeh Daneshamooz, Parviz Fattahi, Seyed Mohammad Hassan Hosseini:
Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage. Kybernetes 50(12): 3222-3245 (2021) - 2020
- [j13]Mehrnoosh Taherkhani
Mixed-integer linear programming model for tree-like pipeline scheduling problem with intermediate due dates on demands. Oper. Res. 20(1): 399-425 (2020)
2010 – 2019
- 2016
- [j12]Vahid Hajipour
Bi-objective vibration damping optimization for congested location-pricing problem. Comput. Oper. Res. 70: 87-100 (2016) - [j11]Meysam Rabiee
A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness. Int. J. Comput. Integr. Manuf. 29(9): 1007-1024 (2016) - 2015
- [j10]Parvaneh Samouei
A network approach modeling of multi-echelon spare-part inventory system with backorders and quantity discount. Ann. Oper. Res. 226(1): 551-563 (2015) - [j9]Parviz Fattahi
A bi-objective continuous review inventory control model: Pareto-based meta-heuristic algorithms. Appl. Soft Comput. 32: 211-223 (2015) - [j8]Mohammad Rohaninejad
Two hybrid tabu search-firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int. J. Comput. Integr. Manuf. 28(5): 470-487 (2015) - [j7]Amir Jalilvand-Nejad, Parviz Fattahi
A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem. J. Intell. Manuf. 26(6): 1085-1098 (2015) - 2014
- [j6]Zahra Tajbakhsh, Parviz Fattahi
Multi-objective assembly permutation flow shop scheduling problem: a mathematical model and a meta-heuristic algorithm. J. Oper. Res. Soc. 65(10): 1580-1592 (2014) - 2013
- [j5]Reza Ramezanian
Integrated lot-sizing and scheduling with overlapping for multi-level capacitated production system. Int. J. Comput. Integr. Manuf. 26(7): 681-695 (2013) - 2012
- [j4]Abdolreza Roshani
Cost-oriented two-sided assembly line balancing problem: A simulated annealing approach. Int. J. Comput. Integr. Manuf. 25(8): 689-715 (2012) - [j3]Fariborz Jolai
Cyclic scheduling of a robotic flexible cell with load lock and swap. J. Intell. Manuf. 23(5): 1885-1891 (2012)
2000 – 2009
- 2007
- [j2]Fariborz Jolai
Exact algorithm for bi-objective 0-1 knapsack problem. Appl. Math. Comput. 194(2): 544-551 (2007) - [j1]Parviz Fattahi
Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3): 331-342 (2007)
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-08-03 20:16 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: