 | 2012 |
| 58 |  | A. Bellanger,
Adam Janiak,
Mikhail Y. Kovalyov,
Ammar Oulamara:
Scheduling an unbounded batching machine with job processing time compatibilities.
Discrete Applied Mathematics 160(1-2): 15-23 (2012) |
| 57 |  | F. J. Hwang,
Mikhail Y. Kovalyov,
Bertrand M. T. Lin:
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence.
Discrete Optimization 9(1): 29-39 (2012) |
| 56 |  | Jacek Blazewicz,
Edmund K. Burke,
Valery S. Gordon,
Mikhail Y. Kovalyov,
Yakov M. Shafransky,
Vitaly A. Strusevich:
Editorial: new branches, old roots.
J. Scheduling 15(4): 399-401 (2012) |
| 55 |  | Valery S. Gordon,
Mikhail Y. Kovalyov,
G. M. Levin,
Yakov M. Shafransky,
Y. N. Sotskov,
Vitaly A. Strusevich,
Alexander V. Tuzikov:
Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Scheduling 15(4): 403-418 (2012) |
| 2011 |
| 54 |  | Jacek Blazewicz,
Edmund K. Burke,
Marta Kasprzak,
Alexandr Kovalev,
Mikhail Y. Kovalyov:
The simplified partial digest problem: Approximation and a graph-theoretic model.
European Journal of Operational Research 208(2): 142-152 (2011) |
| 53 |  | Hassene Aissi,
Mohamed Ali Aloulou,
Mikhail Y. Kovalyov:
Minimizing the number of late jobs on a single machine under due date uncertainty.
J. Scheduling 14(4): 351-360 (2011) |
| 2010 |
| 52 |  | Jacek Blazewicz,
Mikhail Y. Kovalyov,
Jedrzej Musial,
Andrzej P. Urbanski,
Adam Wojciechowski:
Internet shopping optimization problem.
Applied Mathematics and Computer Science 20(2): 385-390 (2010) |
| 51 |  | Mikhail Y. Kovalyov,
Erwin Pesch:
A generic approach to proving NP-hardness of partition type problems.
Discrete Applied Mathematics 158(17): 1908-1912 (2010) |
| 50 |  | A. Bellanger,
Ammar Oulamara,
Mikhail Y. Kovalyov:
Minimizing total completion time on a batching machine with job processing time compatibilities.
Electronic Notes in Discrete Mathematics 36: 1295-1302 (2010) |
| 49 |  | C. T. Ng,
Mikhail Y. Kovalyov,
T. C. E. Cheng:
A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.
European Journal of Operational Research 200(2): 621-624 (2010) |
| 48 |  | C. T. Ng,
M. S. Barketau,
T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.
European Journal of Operational Research 207(2): 601-604 (2010) |
| 2009 |
| 47 |  | Jacek Blazewicz,
Edmund K. Burke,
Marta Kasprzak,
Alexandr Kovalev,
Mikhail Y. Kovalyov:
On the approximability of the Simplified Partial Digest Problem.
Discrete Applied Mathematics 157(17): 3586-3592 (2009) |
| 46 |  | C. T. Ng,
T. C. Edwin Cheng,
Vladimir Kotov,
Mikhail Y. Kovalyov:
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discrete Applied Mathematics 157(8): 1806-1824 (2009) |
| 2008 |
| 45 |  | Alexandre Dolgui,
Mikhail Y. Kovalyov,
Kseniya Shchamialiova:
Lot-Sizing and Sequencing on a Single Imperfect Machine.
MCO 2008: 117-125 |
| 44 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov,
C. T. Ng,
S. S. Lam:
Group sequencing around a common due date.
Discrete Optimization 5(3): 594-604 (2008) |
| 43 |  | Ali Allahverdi,
C. T. Ng,
T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
A survey of scheduling problems with setup times or costs.
European Journal of Operational Research 187(3): 985-1032 (2008) |
| 42 |  | M. S. Barketau,
T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Batch scheduling of deteriorating reworkables.
European Journal of Operational Research 189(3): 1317-1326 (2008) |
| 41 |  | Mikhail Y. Kovalyov,
Silvano Martello:
Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII).
European Journal of Operational Research 189(3): 803-806 (2008) |
| 40 |  | Sergei Chubanov,
Mikhail Y. Kovalyov,
Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation.
European Journal of Operational Research 189(3): 877-889 (2008) |
| 39 |  | M. S. Barketau,
T. C. Edwin Cheng,
C. T. Ng,
Vladimir Kotov,
Mikhail Y. Kovalyov:
Batch scheduling of step deteriorating jobs.
J. Scheduling 11(1): 17-28 (2008) |
| 2007 |
| 38 |  | Mikhail Y. Kovalyov,
Frank Werner:
Problem F.
European Journal of Operational Research 177(2): 1310-1311 (2007) |
| 37 |  | Mikhail Y. Kovalyov,
C. T. Ng,
T. C. Edwin Cheng:
Fixed interval scheduling: Models, applications, computational complexity and algorithms.
European Journal of Operational Research 178(2): 331-342 (2007) |
| 36 |  | Fawaz S. Al-Anzi,
Ali Allahverdi,
Mikhail Y. Kovalyov:
Batching deteriorating items with applications in computer communication and reverse logistics.
European Journal of Operational Research 182(3): 1002-1011 (2007) |
| 35 |  | Adam Janiak,
Mikhail Y. Kovalyov,
Marcin Marek:
Soft Due Window Assignment and Scheduling on Parallel Machines.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 37(5): 614-620 (2007) |
| 34 |  | Jacek Blazewicz,
Edmund K. Burke,
Marta Kasprzak,
Alexandr Kovalev,
Mikhail Y. Kovalyov:
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 668-680 (2007) |
| 33 |  | C. T. Ng,
Mikhail Y. Kovalyov:
Batching and scheduling in a multi-machine flow shop.
J. Scheduling 10(6): 353-364 (2007) |
| 32 |  | Mohamed Ali Aloulou,
Mikhail Y. Kovalyov,
Marie-Claude Portmann:
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity.
RAIRO - Operations Research 41(1): 1-18 (2007) |
| 2006 |
| 31 |  | Karl Inderfurth,
Adam Janiak,
Mikhail Y. Kovalyov,
Frank Werner:
Batching work and rework processes with limited deterioration of reworkables.
Computers & OR 33: 1595-1605 (2006) |
| 30 |  | Adam Janiak,
Mikhail Y. Kovalyov:
Scheduling in a contaminated area: A model and polynomial algorithms.
European Journal of Operational Research 173(1): 125-132 (2006) |
| 29 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov,
Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Makespan minimization.
European Journal of Operational Research 175(2): 751-768 (2006) |
| 28 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov,
Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Total completion time minimization.
European Journal of Operational Research 175(2): 769-781 (2006) |
| 27 |  | Jacek Blazewicz,
Mikhail Y. Kovalyov,
Maciej Machowiak,
Denis Trystram,
Jan Weglarz:
Preemptable Malleable Task Scheduling Problem.
IEEE Trans. Computers 55(4): 486-490 (2006) |
| 26 |  | Adam Janiak,
Mikhail Y. Kovalyov:
Job Sequencing with Exponential Functions of Processing Times.
Informatica, Lith. Acad. Sci. 17(1): 13-24 (2006) |
| 25 |  | Mikhail Y. Kovalyov,
Marie-Claude Portmann,
Ammar Oulamara:
Optimal testing and repairing a failed series system.
J. Comb. Optim. 12(3): 279-295 (2006) |
| 24 |  | Sergei Chubanov,
Mikhail Y. Kovalyov,
Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.
Math. Program. 106(3): 453-466 (2006) |
| 2005 |
| 23 |  | C. T. Ng,
T. C. Edwin Cheng,
Adam Janiak,
Mikhail Y. Kovalyov:
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Annals OR 133(1-4): 163-174 (2005) |
| 22 |  | Adam Janiak,
Mikhail Y. Kovalyov,
Marie-Claude Portmann:
Single machine group scheduling with resource dependent setup and processing times.
European Journal of Operational Research 162(1): 112-121 (2005) |
| 21 |  | Adam Janiak,
Mikhail Y. Kovalyov,
Wieslaw Kubiak,
Frank Werner:
Positive half-products and scheduling with controllable processing times.
European Journal of Operational Research 165(2): 416-422 (2005) |
| 2004 |
| 20 |  | Mohamed Ali Aloulou,
Mikhail Y. Kovalyov,
Marie-Claude Portmann:
Maximization Problems in Single Machine Scheduling.
Annals OR 129(1-4): 21-32 (2004) |
| 19 |  | Jacek Blazewicz,
Maciej Machowiak,
Jan Weglarz,
Mikhail Y. Kovalyov,
Denis Trystram:
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan.
Annals OR 129(1-4): 65-80 (2004) |
| 18 |  | C. T. Daniel Ng,
T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Single machine batch scheduling with jointly compressible setup and processing times.
European Journal of Operational Research 153(1): 211-219 (2004) |
| 17 |  | Mikhail Y. Kovalyov,
Chris N. Potts,
Vitaly A. Strusevich:
Batching decisions for assembly production systems.
European Journal of Operational Research 157(3): 620-642 (2004) |
| 2003 |
| 16 |  | 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.
Computers & OR 30(8): 1173-1185 (2003) |
| 15 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Scheduling a Single Server in a Two-machine Flow Shop.
Computing 70(2): 167-180 (2003) |
| 2002 |
| 14 |  | 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.
Computers & OR 29(14): 2087-2091 (2002) |
| 13 |  | Wieslaw Kubiak,
Jinliang Cheng,
Mikhail Y. Kovalyov:
Fast fully polynomial approximation schemes for minimizing completion time variance.
European Journal of Operational Research 137(2): 303-309 (2002) |
| 12 |  | Aleksander Bachman,
Adam Janiak,
Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs.
Inf. Process. Lett. 81(2): 81-84 (2002) |
| 11 |  | Mikhail Y. Kovalyov,
Marcus Pattloch,
Günter Schmidt:
A polynomial algorithm for lot-size scheduling of two type tasks.
Inf. Process. Lett. 83(4): 229-235 (2002) |
| 10 |  | Mikhail Y. Kovalyov,
Frank Werner:
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness.
J. Heuristics 8(4): 415-428 (2002) |
| 2001 |
| 9 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Single Supplier Scheduling for Multiple Deliveries.
Annals OR 107(1-4): 51-63 (2001) |
| 8 |  | T. C. Edwin Cheng,
Adam Janiak,
Mikhail Y. Kovalyov:
Single machine batch scheduling with resource dependent setup and processing times.
European Journal of Operational Research 135(1): 177-183 (2001) |
| 2000 |
| 7 |  | Chris N. Potts,
Mikhail Y. Kovalyov:
Scheduling with batching: A review.
European Journal of Operational Research 120(2): 228-249 (2000) |
| 1999 |
| 6 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness.
European Journal of Operational Research 114(2): 403-410 (1999) |
| 1998 |
| 5 |  | Mikhail Y. Kovalyov,
Yakov M. Shafransky:
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints.
Discrete Applied Mathematics 84(1-3): 253-257 (1998) |
| 4 |  | Mikhail Y. Kovalyov,
Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.
J. Heuristics 3(4): 287-297 (1998) |
| 1997 |
| 3 |  | Mikhail Y. Kovalyov:
Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case.
Discrete Applied Mathematics 80(2-3): 251-254 (1997) |
| 2 |  | Mikhail Y. Kovalyov,
Yakov M. Shafransky:
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case.
Inf. Process. Lett. 64(2): 69-74 (1997) |
| 1996 |
| 1 |  | T. C. Edwin Cheng,
Mikhail Y. Kovalyov:
Batch Scheduling and Common Due-date Assignment on a Single Machine.
Discrete Applied Mathematics 70(3): 231-245 (1996) |