The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aziz Moukrim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Aziz Moukrim, Eric Sanlaville, Frédéric Guinand
    Scheduling with Communication Delays and On-Line Disturbances. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:350-357 [Conf]
  2. Marc Chardon, Aziz Moukrim
    Optimal Schedules of Coffman-Graham Algorithm for a New Order Class. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:138- [Conf]
  3. Aziz Moukrim, Alain Quilliot
    Scheduling with Communication Delays and Data Routing in Message Passing Architectures. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:438-451 [Conf]
  4. Corinne Lucet, Florence Mendes, Aziz Moukrim
    Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:315-325 [Conf]
  5. François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
    New Lower and Upper Bounds for Graph Treewidth. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:70-80 [Conf]
  6. Corinne Lucet, Florence Mendes, Aziz Moukrim
    An exact method for graph coloring. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:2189-2207 [Journal]
  7. Aziz Moukrim
    Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:461-476 [Journal]
  8. Jonas Koko, Aziz Moukrim
    Parallel Implementation of a Generalized Conjugate Gradient Algorithm. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 1998, v:9, n:4, pp:437-448 [Journal]
  9. Aziz Moukrim
    Optimal scheduling on parallel machines for a new order class. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:91-95 [Journal]
  10. Aziz Moukrim, Alain Quilliot
    Optimal preemptive scheduling on a fixed number of identical parallel machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:143-150 [Journal]
  11. Frédéric Guinand, Aziz Moukrim, Eric Sanlaville
    Sensitivity analysis of tree scheduling on two machines with communication delays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:1, pp:103-120 [Journal]
  12. Marc Chardon, Aziz Moukrim
    The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:109-121 [Journal]

  13. A Memetic Algorithm for the Team Orienteering Problem. [Citation Graph (, )][DBLP]


  14. Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time. [Citation Graph (, )][DBLP]


  15. A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. [Citation Graph (, )][DBLP]


  16. A memetic algorithm for the team orienteering problem. [Citation Graph (, )][DBLP]


  17. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. [Citation Graph (, )][DBLP]


  18. A new constraint programming approach for the orthogonal packing problem. [Citation Graph (, )][DBLP]


  19. New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. [Citation Graph (, )][DBLP]


  20. The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. [Citation Graph (, )][DBLP]


  21. A polynomial algorithm for recognizing the Am-order class. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002