The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Artigues: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Artigues, Sana Belmokhtar, Dominique Feillet
    A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:37-49 [Conf]
  2. Sophie Demassey, Christian Artigues, Philippe Michelon
    Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:1, pp:52-65 [Journal]
  3. Christian Artigues, Jean-Charles Billaut, Carl Esswein
    Maximization of solution flexibility for robust shop scheduling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:314-328 [Journal]
  4. Christian Artigues, Philippe Michelon, Stéphane Reusser
    Insertion techniques for static and dynamic resource-constrained project scheduling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:249-267 [Journal]
  5. Mohamed Ali Aloulou, Christian Artigues
    Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2007, pp:1027-1036 [Conf]
  6. Christian Artigues, Pierre Lopez, Pierre-Dimitri Ayache
    Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  7. A Flexible Model and a Hybrid Exact Method for Integrated Employee Timetabling and Production Scheduling. [Citation Graph (, )][DBLP]


  8. Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound. [Citation Graph (, )][DBLP]


  9. A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  10. Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case. [Citation Graph (, )][DBLP]


  11. Parallel machine scheduling with precedence constraints and setup times. [Citation Graph (, )][DBLP]


  12. Event-based MILP models for resource-constrained project scheduling problems. [Citation Graph (, )][DBLP]


  13. Parallel machine scheduling with precedence constraints and setup times [Citation Graph (, )][DBLP]


Search in 0.001secs, 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