The following pages link to C. Lahlou (Q398869):
Displayed 7 items.
- A note on the paper ``Minimizing total tardiness on parallel machines with preemptions'' (Q398870) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- Idempotent version of the Fréchet contingency array problem (Q1040914) (← links)
- Approximation algorithms for scheduling with a limited number of communications (Q1575597) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Single-machine scheduling with time window-dependent processing times (Q5200784) (← links)
- A polynomial Time Algorithm to Solve The Max-atom Problem (Q6370465) (← links)