default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavad Behnamian
Person information
- affiliation: Bu-Ali Sina University, Hamedan, Iran
- affiliation: Amirkabir University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j44]Javad Behnamian
, M. Ghadimi, Mina Farajiamiri:
Data mining-based firefly algorithm for green vehicle routing problem with heterogeneous fleet and refueling constraint. Artif. Intell. Rev. 56(7): 6557-6589 (2023)- [j43]M. Salehi Sarbijan, Javad Behnamian:
A mathematical model and metaheuristic approach to solve the real-time feeder vehicle routing problem. Comput. Ind. Eng. 185: 109684 (2023) - [j42]N. Bagheri Rad, Javad Behnamian:
Real-time multi-factory scheduling in Industry 4.0 with virtual alliances. Eng. Appl. Artif. Intell. 125: 106636 (2023) - [j41]N. Bagheri Rad, Javad Behnamian:
Multi-objective collaborative job shop scheduling in a dynamic environment: Non-dominated sorting memetic algorithm. J. Ambient Intell. Humaniz. Comput. 14(3): 2657-2671 (2023) - [j40]Javad Behnamian, Z. Gharabaghli:
Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach. J. Comb. Optim. 45(2): 80 (2023) - [j39]M. Hajibabaei, Javad Behnamian:
Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation. J. Comb. Optim. 45(5): 112 (2023) - 2022
- [j38]N. Bagheri Rad, Javad Behnamian:
Recent trends in distributed production network scheduling problem. Artif. Intell. Rev. 55(4): 2945-2995 (2022) - [j37]Zahra Fattahi, Javad Behnamian:
Location and transportation of intermodal hazmat considering equipment capacity and congestion impact: elastic method and sub-population genetic algorithm. Ann. Oper. Res. 316(1): 303-341 (2022) - [j36]Saeid Rezaei, Javad Behnamian:
Benders decomposition-based particle swarm optimization for competitive supply networks with a sustainable multi-agent platform and virtual alliances. Appl. Soft Comput. 114: 107985 (2022) - [j35]Mohamed Lotfi, Javad Behnamian:
Collaborative scheduling of operating room in hospital network: Multi-objective learning variable neighborhood search. Appl. Soft Comput. 116: 108233 (2022) - [j34]M. Salehi Sarbijan, Javad Behnamian:
Multi-fleet feeder vehicle routing problem using hybrid metaheuristic. Comput. Oper. Res. 141: 105696 (2022) - [j33]Hassan Bagheri, Javad Behnamian, Samaneh Babaei Morad:
Fuzzy multi-criteria lead and zinc plant site location considering environmental criteria (a case study in Iran). Int. J. Math. Oper. Res. 21(4): 480-496 (2022) - [j32]Hamed Asgari, Javad Behnamian:
Multi-objective stock market portfolio selection using multi-stage stochastic programming with a harmony search algorithm. Neural Comput. Appl. 34(24): 22257-22274 (2022) - [j31]Javad Behnamian, Hamed Asgari:
A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times. RAIRO Oper. Res. 56(6): 4129-4143 (2022) - [j30]F. Davarian, Javad Behnamian:
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints. J. Sched. 25(6): 625-641 (2022) - [j29]M. Salehi Sarbijan, Javad Behnamian:
Real-time collaborative feeder vehicle routing problem with flexible time windows. Swarm Evol. Comput. 75: 101201 (2022) - 2021
- [j28]S. M. T. Fatemi Ghomi, Behrooz Karimi, Javad Behnamian, J. Firoozbakht:
A Multi-objective Particle Swarm Optimization Based on Pareto Archive for Integrated Production and Distribution Planning in A Green Supply Chain. Appl. Artif. Intell. 35(2): 133-153 (2021) - [j27]Saeid Rezaei, Javad Behnamian:
Competition in the growth period of partnership supply networks based on multi-joint distribution and virtual alliance: A sustainable approach. Comput. Ind. Eng. 159: 107524 (2021) - [j26]Mohammad Reza Hassani, Javad Behnamian:
A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. J. Comb. Optim. 41(1): 143-169 (2021) - [j25]Javad Behnamian, Seyyed Mohammad Taghi Fatemi Ghomi:
Multi-objective multi-factory scheduling. RAIRO Oper. Res. 55(Supplement): S1447-S1467 (2021) - [j24]Saeid Rezaei, Javad Behnamian:
Single-item lot-based supplying and batch production under a bilateral capacity reservation: A partnership structure. RAIRO Oper. Res. 55(Supplement): S2633-S2652 (2021) - [j23]Javad Behnamian, S. Memar Dezfooli, Hamed Asgari:
A scatter search algorithm with a novel solution representation for flexible open shop scheduling: a multi-objective optimization. J. Supercomput. 77(11): 13115-13138 (2021)
2010 – 2019
- 2017
- [j22]Javad Behnamian, S. M. T. Fatemi Ghomi, Behrooz Karimi, M. Fadaei Moludi:
A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels. Int. J. Prod. Res. 55(18): 5330-5340 (2017) - [j21]M. R. Valaei, Javad Behnamian:
Allocation and sequencing in 1-out-of-N heterogeneous cold-standby systems: Multi-objective harmony search with dynamic parameters tuning. Reliab. Eng. Syst. Saf. 157: 78-86 (2017) - [j20]Javad Behnamian:
Heterogeneous Networked Cooperative Scheduling With Anarchic Particle Swarm Optimization. IEEE Trans. Engineering Management 64(2): 166-178 (2017) - 2016
- [j19]Javad Behnamian:
Survey on fuzzy shop scheduling. Fuzzy Optim. Decis. Mak. 15(3): 331-366 (2016) - [j18]Javad Behnamian:
Graph colouring-based algorithm to parallel jobs scheduling on parallel factories. Int. J. Comput. Integr. Manuf. 29(6): 622-635 (2016) - [j17]Javad Behnamian, S. M. T. Fatemi Ghomi:
A survey of multi-factory scheduling. J. Intell. Manuf. 27(1): 231-249 (2016) - 2015
- [j16]Javad Behnamian, Seyyed M. T. Fatemi Ghomi:
Minimizing cost-related objective in synchronous scheduling of parallel factories in the virtual production network. Appl. Soft Comput. 29: 221-232 (2015) - [j15]Javad Behnamian:
Multi-cut Benders decomposition approach to collaborative scheduling. Int. J. Comput. Integr. Manuf. 28(11): 1167-1177 (2015) - 2014
- [j14]Javad Behnamian, S. M. T. Fatemi Ghomi:
Multi-objective fuzzy multiprocessor flowshop scheduling. Appl. Soft Comput. 21: 139-148 (2014) - [j13]Javad Behnamian:
Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation. Comput. Oper. Res. 52: 181-191 (2014) - [j12]Javad Behnamian:
A parallel competitive colonial algorithm for JIT flowshop scheduling. J. Comput. Sci. 5(5): 777-783 (2014) - [j11]Zahra Tajbakhsh, Parviz Fattahi, Javad Behnamian:
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
- [j10]Javad Behnamian, S. M. T. Fatemi Ghomi:
The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine. Inf. Sci. 219: 181-196 (2013) - 2012
- [j9]Maedeh Bank, S. M. T. Fatemi Ghomi, Fariborz Jolai, Javad Behnamian:
Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration. Adv. Eng. Softw. 47(1): 1-6 (2012) - [j8]Javad Behnamian, S. M. T. Fatemi Ghomi, Fariborz Jolai, Omid Amirtaheri:
Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm. Appl. Soft Comput. 12(2): 768-777 (2012) - [j7]Javad Behnamian, S. M. T. Fatemi Ghomi, Mostafa Zandieh:
Hybrid flowshop scheduling with sequence-dependent setup times by hybridizing max-min ant system, simulated annealing and variable neighbourhood search. Expert Syst. J. Knowl. Eng. 29(2): 156-169 (2012) - [j6]Javad Behnamian, S. M. T. Fatemi Ghomi:
Incorporating transportation time in multi-agent production network scheduling. Int. J. Comput. Integr. Manuf. 25(12): 1111-1128 (2012) - 2011
- [j5]Javad Behnamian, Mostafa Zandieh:
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst. Appl. 38(12): 14490-14498 (2011) - [j4]Javad Behnamian, Mostafa Zandieh, S. M. T. Fatemi Ghomi:
Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min-max technique. Soft Comput. 15(7): 1313-1331 (2011) - [c1]Javad Behnamian, Seyyed M. T. Fatemi Ghomi, Mostafa Zandieh:
Hybrid solving algorithm for complex machine scheduling problem. IEEM 2011: 794-798 - 2010
- [j3]Javad Behnamian, S. M. T. Fatemi Ghomi:
Development of a PSO-SA hybrid metaheuristic for a new comprehensive regression model to time-series forecasting. Expert Syst. Appl. 37(2): 974-984 (2010)
2000 – 2009
- 2009
- [j2]Javad Behnamian, Mostafa Zandieh, S. M. T. Fatemi Ghomi:
Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Syst. Appl. 36(6): 9637-9644 (2009) - [j1]Javad Behnamian, S. M. T. Fatemi Ghomi, Mostafa Zandieh:
A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. Appl. 36(8): 11057-11069 (2009)
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 2025-01-09 13:23 CET 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:
