Name
Affiliation
Papers
AMEUR SOUKHAL
Laboratoire d'Informatique, Ecole Polytechnique de l'Université de Tours, 64 avenue Jean Portalis, 37200 Tours, France
19
Collaborators
Citations 
PageRank 
29
119
10.15
Referers 
Referees 
References 
264
283
199
Search Limit
100283
Title
Citations
PageRank
Year
Resolution For Bounded-Splitting Jobs Scheduling Problem On A Single Machine In Available Time-Windows00.342021
Optimal workforce assignment to operations of a paced assembly line.50.452018
Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs.10.352017
Non-Disjoint Multi-Agent Scheduling Problem On Identical Parallel Processors00.342016
Two-agent scheduling with agent specific batches on an unbounded serial batching machine100.532015
Solving multi-agent scheduling problems on parallel machines with a global objective function.40.422014
Preprocessing for a map sectorization problem by means of mathematical programming.20.382014
On an extension of the Sort & Search method with application to scheduling theory60.492013
Single-machine multi-agent scheduling problems with a global objective function160.722012
Two-Agent scheduling on an unbounded serial batching machine40.402012
Scheduling on parallel machines with preemption and transportation delays40.492012
Lower bounds for a multi-skill project scheduling problem.10.362011
A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines90.562010
Due dates assignment and JIT scheduling with equal-size jobs80.502010
Interfering Job Set Scheduling on Two-Operation Three-Machine Flowshop30.392009
Some new polynomial cases in just-in-time scheduling problems with multiple due dates30.442008
A note on the complexity of flow shop scheduling with transportation constraints80.712007
Resolution of a scheduling problem in a flowshop robotic cell90.532005
Complexity of flow shop scheduling problems with transportation constraints261.742005