The SCEAS System
Navigation Menu

Search the dblp DataBase


Tamás Kis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. András Kovács, Péter Egri, Tamás Kis, József Váncza
    Proterv-II: An Integrated Production Planning and Scheduling System. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:880-880 [Conf]
  2. Tamás Kis, József Váncza, András Márkus
    Controlling Distributed Manufacturing Systems by a Market Mechanism. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:534-538 [Conf]
  3. Tamás Kis
    On the Complexity of Non-preemptive Shop Scheduling with Two Jobs. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:69, n:1, pp:37-49 [Journal]
  4. Tamás Kis, Alain Hertz
    A Lower Bound for the Job Insertion Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:395-419 [Journal]
  5. András Kovács, Tamás Kis
    Partitioning of trees for minimizing height and cardinality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:4, pp:181-185 [Journal]
  6. Jacek Blazewicz, Klaus H. Ecker, Tamás Kis, Michal Tanas
    A note on the complexity of scheduling coupled tasks on a single processor. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:23-26 [Journal]
  7. Tamás Kis
    A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:103, n:3, pp:515-539 [Journal]
  8. Tamás Kis
    On the complexity of the car sequencing problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:331-335 [Journal]
  9. Tamás Kis
    Project scheduling: a review of recent books. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:1, pp:105-110 [Journal]
  10. Tamás Kis, Richárd Kápolnai
    Approximations and auctions for scheduling batches on related machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:61-68 [Journal]
  11. Tamás Kis, Erwin Pesch
    A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:164, n:3, pp:592-608 [Journal]
  12. Tamás Kis
    Job-shop scheduling with processing alternatives. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:2, pp:307-332 [Journal]
  13. András Kéri, Tamás Kis
    Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2007, pp:127-140 [Conf]

  14. Primal-Dual Combined with Constraint Propagation for Solving RCPSPWET. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002