BibTeX records: Hamid Davoudpour

download as .bib file

@article{DBLP:journals/saem/BishehNEDC22,
  author       = {Mohammad Najjartabar Bisheh and
                  G. Reza Nasiri and
                  Esmaeil Esmaeili and
                  Hamid Davoudpour and
                  Shing I. Chang},
  title        = {A new supply chain distribution network design for two classes of
                  customers using transfer recurrent neural network},
  journal      = {Int. J. Syst. Assur. Eng. Manag.},
  volume       = {13},
  number       = {5},
  pages        = {2604--2618},
  year         = {2022},
  url          = {https://doi.org/10.1007/s13198-022-01670-w},
  doi          = {10.1007/S13198-022-01670-W},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/saem/BishehNEDC22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cor/KarimiD17,
  author       = {Neda Karimi and
                  Hamid Davoudpour},
  title        = {A knowledge-based approach for multi-factory production systems},
  journal      = {Comput. Oper. Res.},
  volume       = {77},
  pages        = {72--85},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.cor.2016.07.003},
  doi          = {10.1016/J.COR.2016.07.003},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cor/KarimiD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/qre/AshrafiDK17,
  author       = {Maryam Ashrafi and
                  Hamid Davoudpour and
                  Vahid Khodakarami},
  title        = {A Bayesian Network to Ease Knowledge Acquisition of Causal Dependence
                  in {CREAM:} Application of Recursive Noisy-OR Gates},
  journal      = {Qual. Reliab. Eng. Int.},
  volume       = {33},
  number       = {3},
  pages        = {479--491},
  year         = {2017},
  url          = {https://doi.org/10.1002/qre.2021},
  doi          = {10.1002/QRE.2021},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qre/AshrafiDK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/asc/KarimiD16,
  author       = {Neda Karimi and
                  Hamid Davoudpour},
  title        = {Multi-objective colonial competitive algorithm for hybrid flowshop
                  problem},
  journal      = {Appl. Soft Comput.},
  volume       = {49},
  pages        = {725--733},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.asoc.2016.06.034},
  doi          = {10.1016/J.ASOC.2016.06.034},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/asc/KarimiD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eaai/AalaeiD16,
  author       = {Amin Aalaei and
                  Hamid Davoudpour},
  title        = {Revised multi-choice goal programming for incorporated dynamic virtual
                  cellular manufacturing into supply chain management: {A} case study},
  journal      = {Eng. Appl. Artif. Intell.},
  volume       = {47},
  pages        = {3--15},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.engappai.2015.04.005},
  doi          = {10.1016/J.ENGAPPAI.2015.04.005},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eaai/AalaeiD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijisscm/AlaviAHD16,
  author       = {Sepideh Alavi and
                  Nader Azad and
                  Mojtaba Heydar and
                  Hamid Davoudpour},
  title        = {Integrated Production, Inventory, and Location-Allocation Decisions
                  in Designing Supply Chain Networks},
  journal      = {Int. J. Inf. Syst. Supply Chain Manag.},
  volume       = {9},
  number       = {4},
  pages        = {22--42},
  year         = {2016},
  url          = {https://doi.org/10.4018/IJISSCM.2016100102},
  doi          = {10.4018/IJISSCM.2016100102},
  timestamp    = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijisscm/AlaviAHD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eswa/KarimiD15,
  author       = {Neda Karimi and
                  Hamid Davoudpour},
  title        = {A branch and bound method for solving multi-factory supply chain scheduling
                  with batch delivery},
  journal      = {Expert Syst. Appl.},
  volume       = {42},
  number       = {1},
  pages        = {238--245},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.eswa.2014.07.025},
  doi          = {10.1016/J.ESWA.2014.07.025},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eswa/KarimiD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/candie/NasiriZD14,
  author       = {G. Reza Nasiri and
                  Rohollah Zolfaghari and
                  Hamid Davoudpour},
  title        = {An integrated supply chain production-distribution planning with stochastic
                  demands},
  journal      = {Comput. Ind. Eng.},
  volume       = {77},
  pages        = {35--45},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cie.2014.08.005},
  doi          = {10.1016/J.CIE.2014.08.005},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/candie/NasiriZD14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cor/KarimiD14,
  author       = {Neda Karimi and
                  Hamid Davoudpour},
  title        = {A high performing metaheuristic for multi-objective flowshop scheduling
                  problem},
  journal      = {Comput. Oper. Res.},
  volume       = {52},
  pages        = {149--156},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cor.2014.01.006},
  doi          = {10.1016/J.COR.2014.01.006},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cor/KarimiD14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/anor/AzadSDMY13,
  author       = {Nader Azad and
                  Georgios K. D. Saharidis and
                  Hamid Davoudpour and
                  Hooman Malekly and
                  Seyed Alireza Yektamaram},
  title        = {Strategies for protecting supply chain networks against facility and
                  transportation disruptions: an improved Benders decomposition approach},
  journal      = {Ann. Oper. Res.},
  volume       = {210},
  number       = {1},
  pages        = {125--163},
  year         = {2013},
  url          = {https://doi.org/10.1007/s10479-012-1146-x},
  doi          = {10.1007/S10479-012-1146-X},
  timestamp    = {Thu, 25 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/AzadSDMY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cor/SadjadyD12,
  author       = {Hannan Sadjady and
                  Hamid Davoudpour},
  title        = {Two-echelon, multi-commodity supply chain network design with mode
                  selection, lead-times and inventory costs},
  journal      = {Comput. Oper. Res.},
  volume       = {39},
  number       = {7},
  pages        = {1345--1354},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.cor.2011.08.003},
  doi          = {10.1016/J.COR.2011.08.003},
  timestamp    = {Mon, 01 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cor/SadjadyD12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jors/MolanaDM12,
  author       = {Seyyed Mohammad Hadji{-}Molana and
                  Hamid Davoudpour and
                  Stefan Minner},
  title        = {An (\emph{r}, \emph{nQ}) inventory model for packaged deteriorating
                  products with compound Poisson demand},
  journal      = {J. Oper. Res. Soc.},
  volume       = {63},
  number       = {11},
  pages        = {1499--1507},
  year         = {2012},
  url          = {https://doi.org/10.1057/jors.2011.154},
  doi          = {10.1057/JORS.2011.154},
  timestamp    = {Fri, 14 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jors/MolanaDM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/semcco/NasiriDM10,
  author       = {G. Reza Nasiri and
                  Hamid Davoudpour and
                  Yaser Movahedi},
  editor       = {Bijaya K. Panigrahi and
                  Swagatam Das and
                  Ponnuthurai Nagaratnam Suganthan and
                  Subhransu Sekhar Dash},
  title        = {A Genetic Algorithm Approach for the Multi-commodity, Multi-period
                  Distribution Planning in a Supply Chain Network Design},
  booktitle    = {Swarm, Evolutionary, and Memetic Computing - First International Conference
                  on Swarm, Evolutionary, and Memetic Computing, {SEMCCO} 2010, Chennai,
                  India, December 16-18, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6466},
  pages        = {494--505},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17563-3\_58},
  doi          = {10.1007/978-3-642-17563-3\_58},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/semcco/NasiriDM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.