Chams Lahlou

According to our database, Chams Lahlou authored at least 12 papers between 1996 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem.

Chams Lahlou, Laurent Truffet

CoRR, 2018

2017

Self-organization and the Maximum Empower Principle in the Framework of max-plus Algebra.

Chams Lahlou, Laurent Truffet

CoRR, 2017

2013

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012).

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

J. Sched., 2013

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

Eur. J. Oper. Res., 2013

2011

A general approach for optimizing regular criteria in the job-shop scheduling problem.

Yazid Mati, Stéphane Dauzère-Pérès, Chams Lahlou

Eur. J. Oper. Res., 2011

Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

CoRR, 2011

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]

Damien Prot, Odile Bellenguez-Morineau, Chams Lahlou

CoRR, 2011

Letter to the Editors.

Chams Lahlou

4OR, 2011

2009

Idempotent version of the Fréchet contingency array problem.

Chams Lahlou, Laurent Truffet

Fuzzy Sets Syst., 2009

2006

Single-machine scheduling with time window-dependent processing times.

Chams Lahlou, Stéphane Dauzère-Pérès

J. Oper. Res. Soc., 2006

2000

Approximation algorithms for scheduling with a limited number of communications.

Chams Lahlou

Parallel Comput., 2000

1996

Scheduling with Unit Processing and Communication Times on a Ring Network: Approximation Results.

Chams Lahlou

Proceedings of the Euro-Par '96 Parallel Processing, 1996