BibTeX records: Yazid Mati

download as .bib file

@article{DBLP:journals/cor/Garcia-LeonDM19,
  author       = {Andr{\'{e}}s Alberto Garc{\'{\i}}a{-}Le{\'{o}}n and
                  St{\'{e}}phane Dauz{\`{e}}re{-}P{\'{e}}r{\`{e}}s and
                  Yazid Mati},
  title        = {An efficient Pareto approach for solving the multi-objective flexible
                  job-shop scheduling problem with regular criteria},
  journal      = {Comput. Oper. Res.},
  volume       = {108},
  pages        = {187--200},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.cor.2019.04.012},
  doi          = {10.1016/J.COR.2019.04.012},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cor/Garcia-LeonDM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eor/MatiDL11,
  author       = {Yazid Mati and
                  St{\'{e}}phane Dauz{\`{e}}re{-}P{\'{e}}r{\`{e}}s and
                  Chams Lahlou},
  title        = {A general approach for optimizing regular criteria in the job-shop
                  scheduling problem},
  journal      = {Eur. J. Oper. Res.},
  volume       = {212},
  number       = {1},
  pages        = {33--42},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.ejor.2011.01.046},
  doi          = {10.1016/J.EJOR.2011.01.046},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eor/MatiDL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tase/MatiX11,
  author       = {Yazid Mati and
                  Xiaolan Xie},
  title        = {Multiresource Shop Scheduling With Resource Flexibility and Blocking},
  journal      = {{IEEE} Trans Autom. Sci. Eng.},
  volume       = {8},
  number       = {1},
  pages        = {175--189},
  year         = {2011},
  url          = {https://doi.org/10.1109/TASE.2010.2052356},
  doi          = {10.1109/TASE.2010.2052356},
  timestamp    = {Thu, 02 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tase/MatiX11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/candie/Mati10,
  author       = {Yazid Mati},
  title        = {Minimizing the makespan in the non-preemptive job-shop scheduling
                  with limited machine availability},
  journal      = {Comput. Ind. Eng.},
  volume       = {59},
  number       = {4},
  pages        = {537--543},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.cie.2010.06.010},
  doi          = {10.1016/J.CIE.2010.06.010},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/candie/Mati10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cor/EssafiMD08,
  author       = {Imen Essafi and
                  Yazid Mati and
                  St{\'{e}}phane Dauz{\`{e}}re{-}P{\'{e}}r{\`{e}}s},
  title        = {A genetic local search algorithm for minimizing total weighted tardiness
                  in the job-shop scheduling problem},
  journal      = {Comput. Oper. Res.},
  volume       = {35},
  number       = {8},
  pages        = {2599--2616},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.cor.2006.12.019},
  doi          = {10.1016/J.COR.2006.12.019},
  timestamp    = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cor/EssafiMD08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eor/MartinezDGMS06,
  author       = {S. Martinez and
                  St{\'{e}}phane Dauz{\`{e}}re{-}P{\'{e}}r{\`{e}}s and
                  Christelle Gu{\'{e}}ret and
                  Yazid Mati and
                  Nathalie Sauer},
  title        = {Complexity of flowshop scheduling problems with a new blocking constraint},
  journal      = {Eur. J. Oper. Res.},
  volume       = {169},
  number       = {3},
  pages        = {855--864},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ejor.2004.08.046},
  doi          = {10.1016/J.EJOR.2004.08.046},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eor/MartinezDGMS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eor/MatiX04,
  author       = {Yazid Mati and
                  Xiaolan Xie},
  title        = {The complexity of two-job shop problems with multi-purpose unrelated
                  machines},
  journal      = {Eur. J. Oper. Res.},
  volume       = {152},
  number       = {1},
  pages        = {159--169},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0377-2217(02)00675-6},
  doi          = {10.1016/S0377-2217(02)00675-6},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eor/MatiX04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icra/MatiX03,
  author       = {Yazid Mati and
                  Xiaolan Xie},
  title        = {A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with
                  Routing Flexibility},
  booktitle    = {Proceedings of the 2003 {IEEE} International Conference on Robotics
                  and Automation, {ICRA} 2003, September 14-19, 2003, Taipei, Taiwan},
  pages        = {157--162},
  publisher    = {{IEEE}},
  year         = {2003},
  url          = {https://doi.org/10.1109/ROBOT.2003.1241589},
  doi          = {10.1109/ROBOT.2003.1241589},
  timestamp    = {Mon, 22 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icra/MatiX03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jim/LandrieuMB01,
  author       = {Antoine Landrieu and
                  Yazid Mati and
                  Zdenek Binder},
  title        = {A tabu search heuristic for the single vehicle pickup and delivery
                  problem with time windows},
  journal      = {J. Intell. Manuf.},
  volume       = {12},
  number       = {5-6},
  pages        = {497--508},
  year         = {2001},
  url          = {https://doi.org/10.1023/A\%3A1012204504849},
  doi          = {10.1023/A\%3A1012204504849},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jim/LandrieuMB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jim/MatiRX01,
  author       = {Yazid Mati and
                  Nidhal Rezg and
                  Xiaolan Xie},
  title        = {A taboo search approach for deadlock-free scheduling of automated
                  manufacturing systems},
  journal      = {J. Intell. Manuf.},
  volume       = {12},
  number       = {5-6},
  pages        = {535--552},
  year         = {2001},
  url          = {https://doi.org/10.1023/A\%3A1012260622596},
  doi          = {10.1023/A\%3A1012260622596},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jim/MatiRX01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/trob/MatiRX01,
  author       = {Yazid Mati and
                  Nidhal Rezg and
                  Xiaolan Xie},
  title        = {Geometric approach and taboo search for scheduling flexible manufacturing
                  systems},
  journal      = {{IEEE} Trans. Robotics Autom.},
  volume       = {17},
  number       = {6},
  pages        = {805--818},
  year         = {2001},
  url          = {https://doi.org/10.1109/70.975998},
  doi          = {10.1109/70.975998},
  timestamp    = {Tue, 19 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/trob/MatiRX01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/smc/MatiRX01,
  author       = {Yazid Mati and
                  Nidhal Rezg and
                  Xiaolan Xie},
  title        = {An integrated greedy heuristic for a flexible job shop scheduling
                  problem},
  booktitle    = {Proceedings of the {IEEE} International Conference on Systems, Man
                  {\&} Cybernetics: "e-Systems and e-Man for Cybernetics in Cyberspace",
                  Tucson, Arizona, USA, 7-10 October 2001},
  pages        = {2534--2539},
  publisher    = {{IEEE}},
  year         = {2001},
  url          = {https://doi.org/10.1109/ICSMC.2001.972939},
  doi          = {10.1109/ICSMC.2001.972939},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/smc/MatiRX01.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.