The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philippe Baptiste: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philippe Baptiste, Claude Le Pape
    Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:375-389 [Conf]
  2. Philippe Baptiste, Claude Le Pape, Laurent Péridy
    Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1998, pp:87-101 [Conf]
  3. Konstantin Artiouchine, Philippe Baptiste
    Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:62-76 [Conf]
  4. Claude Le Pape, Philippe Baptiste
    Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:619-623 [Conf]
  5. Philippe Baptiste, Claude Le Pape
    A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:600-606 [Conf]
  6. Philippe Baptiste, Vadim G. Timkovsky
    On preemption redundancy in scheduling unit processing time jobs on two parallel machines. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:200- [Conf]
  7. Dac-Huy Tran, Philippe Baptiste, Vu Duong
    From Sets to Geometrical Sectors in the Airspace Sectorization Problem. [Citation Graph (0, 0)][DBLP]
    RIVF, 2004, pp:7-10 [Conf]
  8. Huy Trandac, Philippe Baptiste, Vu Duong
    Airspace Sectorization By Constraint Programming. [Citation Graph (0, 0)][DBLP]
    RIVF, 2003, pp:49-58 [Conf]
  9. Philippe Baptiste
    Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:364-367 [Conf]
  10. Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
    Ten notes on equal-processing-time scheduling. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:2, pp:111-127 [Journal]
  11. Philippe Baptiste, Claude Le Pape
    Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    Constraints, 2000, v:5, n:1/2, pp:119-139 [Journal]
  12. Claude Le Pape, Philippe Baptiste
    Resource Constraints for Preemptive Job-shop Scheduling. [Citation Graph (0, 0)][DBLP]
    Constraints, 1998, v:3, n:4, pp:263-287 [Journal]
  13. Philippe Baptiste
    A note on scheduling multiprocessor tasks with identical processing times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:13, pp:2071-2078 [Journal]
  14. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  15. Philippe Baptiste
    Scheduling equal-length jobs on identical parallel machines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:21-32 [Journal]
  16. Claude Le Pape, Philippe Baptiste
    Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:3, pp:305-325 [Journal]
  17. Philippe Baptiste, Vadim G. Timkovsky
    On preemption redundancy in scheduling unit processing time jobs on two parallel machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:5, pp:205-212 [Journal]
  18. Philippe Baptiste
    An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:175-180 [Journal]
  19. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive scheduling of equal-length jobs to maximize weighted throughput. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:258-264 [Journal]
  20. Philippe Baptiste
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:139-140 [Journal]
  21. Philippe Baptiste, Baruch Schieber
    A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:4, pp:395-404 [Journal]
  22. Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
    The complexity of mean flow time scheduling problems with release times. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:139-146 [Journal]
  23. Philippe Baptiste, Jacques Carlier, Antoine Jouglet
    A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:158, n:3, pp:595-608 [Journal]
  24. Philippe Baptiste, Laurent Péridy, Eric Pinson
    A branch and bound to minimize the number of late jobs on a single machine with release time constraints. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:144, n:1, pp:1-11 [Journal]
  25. Philippe Baptiste
    On minimizing the weighted number of late jobs in unit execution time open-shops. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:344-354 [Journal]
  26. Philippe Baptiste, Marek Chrobak, Christoph Dürr
    Polynomial Time Algorithms for Minimum Energy Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:136-150 [Conf]
  27. Konstantin Artiouchine, Philippe Baptiste
    Arc-B-consistency of the Inter-distance Constraint. [Citation Graph (0, 0)][DBLP]
    Constraints, 2007, v:12, n:1, pp:3-19 [Journal]
  28. Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
    Fast paths in large-scale dynamic road networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  29. Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
    The Complexity of Mean Flow Time Scheduling Problems with Release Times [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  30. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
    Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  31. Constraint-Based Schedulers, Do They Really Work? [Citation Graph (, )][DBLP]


  32. Integrality Property in Preemptive Parallel Machine Scheduling. [Citation Graph (, )][DBLP]


  33. Lower bounds for parallel machines scheduling. [Citation Graph (, )][DBLP]


  34. Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. [Citation Graph (, )][DBLP]


  35. Fast point-to-point shortest path queries on dynamic road networks with interfal data. [Citation Graph (, )][DBLP]


  36. Lagrangian bounds for just-in-time job-shop scheduling. [Citation Graph (, )][DBLP]


  37. Polynomial Time Algorithms for Minimum Energy Scheduling [Citation Graph (, )][DBLP]


  38. On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. [Citation Graph (, )][DBLP]


  39. A note on scheduling identical coupled tasks in logarithmic time. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.042secs
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