Nombre de documents

20

Chams Lahlou


 

  • Recherche opérationnelle

  • Ordonnancement

  • Complexité

 

Page personnelle à l'Ecole des mines de Nantes


Article dans une revue9 documents

  • Olivier Le Corre, Laurent Truffet, Chams Lahlou. Odum-Tennenbaum-Brown calculus vs emergy and co-emergy analysis. Ecological Modelling, Elsevier, 2015, 302, pp.9-12. 〈10.1016/j.ecolmodel.2015.01.021〉. 〈hal-01201683〉
  • Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou. A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012). Journal of Scheduling, Springer Verlag, 2013, 16 (4), pp.437-438. 〈10.1007/s10951-012-0283-z〉. 〈hal-00752948〉
  • Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou. New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria. European Journal of Operational Research, Elsevier, 2013, 231 (2), pp.282-287. 〈10.1016/j.ejor.2013.05.041〉. 〈hal-00827762〉
  • Yazid Mati, Chams Lahlou, Stéphane Dauzère-Pérès. Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints. International Journal of Production Research, Taylor & Francis, 2011, 49 (8), pp.2169-2182. 〈10.1080/00207541003733775〉. 〈emse-00519237〉
  • Yazid Mati, Stéphane Dauzère-Pérès, Chams Lahlou. A general approach for optimizing regular criteria in the job-shop scheduling problem. European Journal of Operational Research, Elsevier, 2011, 212, pp.33-42. 〈10.1016/j.ejor.2011.01.046〉. 〈emse-00613008〉
  • Yazid Mati, Chams Lahlou, Stephane Dauzere-Peres. Modelling and Solving a Practical Flexible Job-Shop Scheduling Problem with Blocking Constraints. International Journal of Production Research, Taylor & Francis, 2010, pp.1. 〈10.1080/00207541003733775〉. 〈hal-00592055〉
  • Chams Lahlou, Laurent Truffet. Idempotent version of the Fréchet contingency array problem. Fuzzy Sets and Systems, Elsevier, 2009, 160 (16), pp.2317-2327. 〈10.1016/j.fss.2009.03.003〉. 〈hal-00862811〉
  • Chams Lahlou, Stéphane Dauzère-Pérès. Single-machine scheduling with time window-dependent processing times. Journal of the Operational Research Society, Palgrave Macmillan, 2006, 57 (2), pp.133-139. 〈10.1057/palgrave.jors.2601931〉. 〈hal-00363040〉
  • Chams Lahlou. Approximation algorithms for scheduling with a limited number of communications. Parallel Computing, Elsevier, 2000, 26 (9), pp.1129-1162. 〈10.1016/S0167-8191(00)00032-6〉. 〈hal-00363041〉

Communication dans un congrès8 documents

  • Denis Daste, Christelle Gueret, Chams Lahlou. A Branch-and-Price algorithm to minimize the maximum lateness on a batch processing machine. PMS'08, Apr 2008, IStanbul, Turkey. pp.64-69, 2008. 〈hal-00362659〉
  • Denis Daste, Christelle Gueret, Chams Lahlou. Génération de colonnes pour l'ordonnancement d'une machine à traitement par fournées. MOSIM'08, Mar 2008, Paris, France. 3, pp.1783-1790, 2008. 〈hal-00362152〉
  • Imen Essafi, Stéphane Dauzère-Pérès, Chams Lahlou. Two local search approaches for minimizing total weighted tardiness in a job shop with customer orders. Models and Algorithms for Planning and Scheduling Problems (MAPSP 2005), Jun 2005, Sienne, Italy. 〈hal-00363043〉
  • Imen Essafi, Stéphane Dauzère-Pérès, Chams Lahlou. Customer order scheduling on a single machine with release dates. 20th European Conference on Operational Research (EURO XX), Jul 2004, rhodes, Greece. 〈hal-00363045〉
  • Imen Essafi, Stéphane Dauzère-Pérès, Chams Lahlou. Single machine customer order scheduling to minimize total weighted late orders. International Symposium on Combinatorial Optimization (CO'04), Mar 2004, lancaster, United Kingdom. 〈hal-00363046〉
  • Imen Essafi, Stéphane Dauzère-Pérès, Chams Lahlou. Ordonnancement des commandes clients sur une machine. Lavoisier. MOSIM'04, Sep 2004, nantes, France. pp.181-189, 2004. 〈hal-00363042〉
  • Chams Lahlou, Stéphane Dauzère-Pérès. Single machine scheduling of jobs with time window dependent processing times. International Symposium on Combinatorial Optimization (CO'02), Apr 2002, Paris, France. 〈hal-00363044〉
  • Chams Lahlou. Scheduling with unit processing and communication times on a ring network: Approximation results. Springer Berlin / Heidelberg. Second International Euro-Par Conference, Aug 1996, Lyon, France. 1124, pp.539-542, 1996, Lecture Notes in Computer Science. 〈10.1007/BFb0024746〉. 〈hal-00365913〉

Ouvrage (y compris édition critique et traduction)1 document

  • Christian Artigues, Philippe Baptiste, Jacques Carlier, Philippe Chrétienne, Christelle Guéret, et al.. Modèles et Algorithmes en Ordonnancement: Exercices et Problèmes Corrigés. Ellipses, 227 p, 2004, 978-2729821715. 〈inria-00108094〉

Chapitre d'ouvrage2 documents

  • Stéphane Dauzère-Pérès, Philippe Castagliola, Chams Lahlou. Service Level in Scheduling. Jean-Charles Billaut, Aziz Moukrim, Eric Sanlaville. Flexibility and Robustness in Scheduling, ISTE-Wiley, pp.99-121, 2008. 〈hal-00344831〉
  • Stéphane Dauzère-Pérès, Philippe Castagliola, Chams Lahlou. Niveau de service en ordonnancement. J.C. Billaut, A. Moukrim & E. Sanlaville. Flexibilité et robustesse en ordonnancement, Hermès-Lavoisier, pp.97-113, 2005, Traité IC2, série Informatique et Systèmes d'Information. 〈hal-00340856〉