Login / Signup
Chams Lahlou
ORCID
Publication Activity (10 Years)
Years Active: 1996-2018
Publications (10 Years): 2
Top Topics
Scheduling Problem
Release Dates
Flowshop
Parallel Machines
Top Venues
CoRR
J. Sched.
Eur. J. Oper. Res.
</>
Publications
</>
Chams Lahlou
,
Laurent Truffet
A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem.
CoRR
(2018)
Chams Lahlou
,
Laurent Truffet
Self-organization and the Maximum Empower Principle in the Framework of max-plus Algebra.
CoRR
(2017)
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).
J. Sched.
16 (4) (2013)
Damien Prot
,
Odile Bellenguez-Morineau
,
Chams Lahlou
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.
Eur. J. Oper. Res.
231 (2) (2013)
Damien Prot
,
Odile Bellenguez-Morineau
,
Chams Lahlou
A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]
CoRR
(2011)
Damien Prot
,
Odile Bellenguez-Morineau
,
Chams Lahlou
Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates
CoRR
(2011)
Chams Lahlou
Letter to the Editors.
4OR
9 (1) (2011)
Yazid Mati
,
Stéphane Dauzère-Pérès
,
Chams Lahlou
A general approach for optimizing regular criteria in the job-shop scheduling problem.
Eur. J. Oper. Res.
212 (1) (2011)
Chams Lahlou
,
Laurent Truffet
Idempotent version of the Fréchet contingency array problem.
Fuzzy Sets Syst.
160 (16) (2009)
Chams Lahlou
,
Stéphane Dauzère-Pérès
Single-machine scheduling with time window-dependent processing times.
J. Oper. Res. Soc.
57 (2) (2006)
Chams Lahlou
Approximation algorithms for scheduling with a limited number of communications.
Parallel Comput.
26 (9) (2000)
Chams Lahlou
Scheduling with Unit Processing and Communication Times on a Ring Network: Approximation Results.
Euro-Par, Vol. II
(1996)