The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Peter Brucker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Brucker, Svetlana A. Kravchenko
    Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. [Citation Graph (0, 0)][DBLP]
    ICCSA (4), 2005, pp:182-191 [Conf]
  2. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    Fast Algorithms with Algebraic Monge Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:104-117 [Conf]
  3. Peter Brucker, Sigrid Knust
    Resource-Constrained Project Scheduling and Timetabling. [Citation Graph (0, 0)][DBLP]
    PATAT, 2000, pp:277-293 [Conf]
  4. Peter Brucker
    The Chinese Postman Problem for Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:354-366 [Conf]
  5. 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]
  6. Peter Brucker, Sigrid Knust
    Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. [Citation Graph (0, 0)][DBLP]
    Computing, 1999, v:63, n:4, pp:299-316 [Journal]
  7. Susanne Albers, Peter Brucker
    The Complexity of One-Machine Batching Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:87-107 [Journal]
  8. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    The algebraic Monge property and path problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:455-464 [Journal]
  9. Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
    A Monge Property for the D-dimensional Transportation Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:2, pp:97-109 [Journal]
  10. Peter Brucker
    Scheduling and constraint propagation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:227-256 [Journal]
  11. Peter Brucker
    Efficient Algorithms for Some Path Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:77-85 [Journal]
  12. Peter Brucker, Thomas Hilbig, Johann Hurink
    A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:77-99 [Journal]
  13. Peter Brucker, Johann Hurink, Bernd Jurisch, Birgit Wöstmann
    A Branch & Bound Algorithm for the Open-shop Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:43-59 [Journal]
  14. Peter Brucker, Johann Hurink, Frank Werner
    Improving Local Search Heuristics for Some Scheduling Problems-I. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:97-122 [Journal]
  15. Peter Brucker, Johann Hurink, Frank Werner
    Improving Local Search Heuristics for some Scheduling Problems. Part II. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:47-69 [Journal]
  16. Peter Brucker, Bernd Jurisch, Bernd Sievers
    A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:107-127 [Journal]
  17. Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
    Series parallel composition of greedy linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:1-14 [Journal]
  18. Peter Brucker, Silvia Heitmann, Johann Hurink
    How useful are preemptive schedules? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:129-136 [Journal]
  19. Peter Brucker, Thomas Kampmeyer
    Tabu Search Algorithms for Cyclic Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:4, pp:303-322 [Journal]
  20. 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]
  21. Peter Brucker, Sigrid Knust, Guoqing Wang
    Complexity results for flow-shop problems with a single server. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:398-407 [Journal]
  22. Peter Brucker, Sigrid Knust
    Lower bounds for resource-constrained project scheduling problems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:302-313 [Journal]
  23. Peter Brucker, Sigrid Knust
    Sequencing and scheduling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:247-248 [Journal]
  24. 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]

  25. Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. [Citation Graph (, )][DBLP]


  26. A general model for cyclic machine scheduling problems. [Citation Graph (, )][DBLP]


  27. Scheduling two irregular polygons. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002