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

Search the dblp DataBase

Title:
Author:
Mikhail Y. Kovalyov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. T. C. Edwin Cheng, Mikhail Y. Kovalyov
    Scheduling a Single Server in a Two-machine Flow Shop. [Citation Graph (0, 0)][DBLP]
    Computing, 2003, v:70, n:2, pp:167-180 [Journal]
  2. T. C. Edwin Cheng, Mikhail Y. Kovalyov
    An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:14, pp:2087-2091 [Journal]
  3. Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov, Frank Werner
    Batching work and rework processes with limited deterioration of reworkables. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:, pp:1595-1605 [Journal]
  4. C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, S. S. Lam
    Single machine scheduling with a variable common due date and resource-dependent processing times. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:8, pp:1173-1185 [Journal]
  5. T. C. Edwin Cheng, Mikhail Y. Kovalyov
    Batch Scheduling and Common Due-date Assignment on a Single Machine. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:3, pp:231-245 [Journal]
  6. Mikhail Y. Kovalyov
    Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:251-254 [Journal]
  7. Mikhail Y. Kovalyov, Yakov M. Shafransky
    Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:253-257 [Journal]
  8. Mikhail Y. Kovalyov, Wieslaw Kubiak
    A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1998, v:3, n:4, pp:287-297 [Journal]
  9. Mikhail Y. Kovalyov, Frank Werner
    Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:4, pp:415-428 [Journal]
  10. Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov
    Minimizing the total weighted completion time of deteriorating jobs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:81-84 [Journal]
  11. Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt
    A polynomial algorithm for lot-size scheduling of two type tasks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:4, pp:229-235 [Journal]
  12. Mikhail Y. Kovalyov, Yakov M. Shafransky
    Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:2, pp:69-74 [Journal]
  13. Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara
    Optimal testing and repairing a failed series system. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:3, pp:279-295 [Journal]
  14. Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch
    An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:3, pp:453-466 [Journal]
  15. Jacek Blazewicz, Mikhail Y. Kovalyov, Maciej Machowiak, Denis Trystram, Jan Weglarz
    Preemptable Malleable Task Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:4, pp:486-490 [Journal]
  16. Adam Janiak, Mikhail Y. Kovalyov
    Scheduling in a contaminated area: A model and polynomial algorithms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:173, n:1, pp:125-132 [Journal]
  17. 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]
  18. 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]
  19. Mikhail Y. Kovalyov, Frank Werner
    Problem F. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:1310-1311 [Journal]
  20. Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng
    Fixed interval scheduling: Models, applications, computational complexity and algorithms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:178, n:2, pp:331-342 [Journal]
  21. Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann
    Single machine group scheduling with resource dependent setup and processing times. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:1, pp:112-121 [Journal]
  22. Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner
    Positive half-products and scheduling with controllable processing times. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:416-422 [Journal]
  23. Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
    Batching decisions for assembly production systems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:3, pp:620-642 [Journal]
  24. C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
    Single machine batch scheduling with jointly compressible setup and processing times. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:153, n:1, pp:211-219 [Journal]
  25. Adam Janiak, Mikhail Y. Kovalyov
    Job Sequencing with Exponential Functions of Processing Times. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 2006, v:17, n:1, pp:13-24 [Journal]

  26. Lot-Sizing and Sequencing on a Single Imperfect Machine. [Citation Graph (, )][DBLP]


  27. The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. [Citation Graph (, )][DBLP]


  28. On the approximability of the Simplified Partial Digest Problem. [Citation Graph (, )][DBLP]


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