| Publication | Date of Publication | Type |
|---|
Exact and heuristic algorithms for the domination problem
European Journal of Operational Research | 2024-06-14 | Paper |
On the complexity of scheduling unrelated parallel machines with limited preemptions
Operations Research Letters | 2023-06-28 | Paper |
A polynomial-time approximation to a minimum dominating set in a graph
Theoretical Computer Science | 2022-08-25 | Paper |
Theoretical and practical issues in single-machine scheduling with two job release and delivery times
Journal of Scheduling | 2022-01-14 | Paper |
| On number of optimal solutions in some scheduling problems | 2021-08-03 | Paper |
Scheduling a single machine with primary and secondary objectives
Algorithms | 2019-10-30 | Paper |
Fast solution of single-machine scheduling problem with embedded jobs
Theoretical Computer Science | 2019-06-06 | Paper |
Theoretical expectation versus practical performance of Jackson's heuristic
Mathematical Problems in Engineering | 2018-08-27 | Paper |
Probabilistic quality estimations for combinatorial optimization problems
Georgian Mathematical Journal | 2018-04-10 | Paper |
A study of single-machine scheduling problem to maximize throughput
Journal of Scheduling | 2014-08-18 | Paper |
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Theoretical Computer Science | 2014-01-10 | Paper |
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Theoretical Computer Science | 2013-01-07 | Paper |
A note on the proof of the complexity of the little-preemptive open-shop problem
Annals of Operations Research | 2012-03-09 | Paper |
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Operations Research Letters | 2009-12-07 | Paper |
| On common properties of two scheduling problems with different objective criteria | 2009-06-23 | Paper |
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Annals of Operations Research | 2008-09-03 | Paper |
An absolute approximation algorithm for scheduling unrelated machines
Naval Research Logistics | 2007-02-20 | Paper |
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2086672 (Why is no real title available?) | 2004-08-11 | Paper |
Single-machine scheduling with release times and tails
Annals of Operations Research | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2079761 (Why is no real title available?) | 2004-07-30 | Paper |
Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Operations Research Letters | 2004-03-15 | Paper |
A better algorithm for sequencing with release and delivery times on identical machines
Journal of Algorithms | 2004-03-14 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Little-preemptive scheduling on unrelated processors
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-04-27 | Paper |
| scientific article; zbMATH DE number 1759466 (Why is no real title available?) | 2002-11-25 | Paper |
Scheduling Equal-Length Jobs with Delivery times on Identical Processors
International Journal of Computer Mathematics | 2002-08-28 | Paper |
Tight performance bounds of CP-scheduling on out-trees
Journal of Combinatorial Optimization | 2002-08-14 | Paper |
Concurrent operations can be parallelized in scheduling multiprocessor job shop
Journal of Scheduling | 2002-08-08 | Paper |
| scientific article; zbMATH DE number 1670679 (Why is no real title available?) | 2001-11-11 | Paper |
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
Journal of Scheduling | 2001-08-20 | Paper |
A survey of methods for the solution of problems of scheduling theory
Applied Mathematics and Informatics | 2001-06-19 | Paper |
| scientific article; zbMATH DE number 1018754 (Why is no real title available?) | 1997-06-09 | Paper |
