Chams Lahlou

12 papers Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2018 J jnl
A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem.
CoRR
Chams Lahlou, Laurent Truffet
2017 J jnl
Self-organization and the Maximum Empower Principle in the Framework of max-plus Algebra.
CoRR
Chams Lahlou, Laurent Truffet
2013 J jnl
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012).
J. Sched.
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
2013 J jnl
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.
Eur. J. Oper. Res.
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
2011 J jnl
A general approach for optimizing regular criteria in the job-shop scheduling problem.
Eur. J. Oper. Res.
Yazid Mati, Stéphane Dauzère-Pérès, Chams Lahlou
2011 J jnl
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
CoRR
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
2011 J jnl
Letter to the Editors.
4OR
Chams Lahlou
2011 J jnl
Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates
CoRR
Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou
2009 J jnl
Idempotent version of the Fréchet contingency array problem.
Fuzzy Sets Syst.
Chams Lahlou, Laurent Truffet
2006 J jnl
Single-machine scheduling with time window-dependent processing times.
J. Oper. Res. Soc.
Chams Lahlou, Stéphane Dauzère-Pérès
2000 J jnl
Approximation algorithms for scheduling with a limited number of communications.
Parallel Comput.
Chams Lahlou
1996 — conf
Scheduling with Unit Processing and Communication Times on a Ring Network: Approximation Results.
Euro-Par, Vol. II
Chams Lahlou