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

Search the dblp DataBase

Title:
Author:
Natalia V. Shakhlevich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Natalia V. Shakhlevich
    Open shop unit-time scheduling problems with symmetric objective functions. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:2, pp:117-131 [Journal]
  2. T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich
    Common due date assignment and scheduling with ready times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:14, pp:1957-1967 [Journal]
  3. Yuri N. Sotskov, Natalia V. Shakhlevich
    NP-hardness of Shop-scheduling Problems with Three Jobs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:237-266 [Journal]
  4. Natalia V. Shakhlevich, Vitaly A. Strusevich
    Single machine scheduling with controllable release and processing parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:15, pp:2178-2199 [Journal]
  5. Natalia V. Shakhlevich, Vitaly A. Strusevich
    Pre-Emptive Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:3, pp:233-253 [Journal]
  6. T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
    Scheduling with controllable release dates and processing times: Makespan minimization. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:175, n:2, pp:751-768 [Journal]
  7. T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
    Scheduling with controllable release dates and processing times: Total completion time minimization. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:175, n:2, pp:769-781 [Journal]
  8. T. C. Edwin Cheng, Natalia V. Shakhlevich
    Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:444-456 [Journal]

  9. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. [Citation Graph (, )][DBLP]


  10. Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. [Citation Graph (, )][DBLP]


  11. Scheduling two jobs with fixed and nonfixed routes. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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