| Publication | Date of Publication | Type |
|---|
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
Computers & Operations Research | 2024-07-08 | Paper |
Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
Communications in Computer and Information Science | 2024-04-03 | Paper |
| A multi-objective sustainable planning for a real hazardous waste production problem | 2022-07-03 | Paper |
| Home health care planning with considering flexible starting/ending points and service features | 2022-05-02 | Paper |
A metric approach for scheduling problems with minimizing the maximum penalty
Applied Mathematical Modelling | 2021-11-15 | Paper |
Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
Automation and Remote Control | 2021-01-14 | Paper |
Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
Automation and Remote Control | 2020-01-27 | Paper |
Minimizing the makespan on two identical parallel machines with mold constraints
Computers & Operations Research | 2019-02-19 | Paper |
A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
Operations Research Proceedings | 2018-10-09 | Paper |
Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
Journal of Scheduling | 2018-04-13 | Paper |
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
Optimization Letters | 2017-06-29 | Paper |
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
Discussiones Mathematicae Graph Theory | 2017-01-23 | Paper |
A new effective dynamic program for an investment optimization problem
Automation and Remote Control | 2017-01-20 | Paper |
Graphs with maximal induced matchings of the same size
Discrete Applied Mathematics | 2016-11-24 | Paper |
Block models for scheduling jobs on two parallel machines with a single server
Computers & Operations Research | 2016-11-10 | Paper |
Using mathematical tessellation to model spherical particle packing structures
International Journal of Mathematics, Game Theory and Algebra | 2016-05-30 | Paper |
A graphical approach to solve an investment optimization problem
Journal of Mathematical Modelling and Algorithms in Operations Research | 2014-12-16 | Paper |
Approximability results for the resource-constrained project scheduling problem with a single type of resources
Annals of Operations Research | 2014-09-26 | Paper |
Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling | 2014-08-18 | Paper |
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
Information Processing Letters | 2014-05-05 | Paper |
Parallel machine problems with equal processing times: a survey
Journal of Scheduling | 2014-02-05 | Paper |
Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling | 2014-02-05 | 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 |
Single machine total tardiness maximization problems: complexity and algorithms
Annals of Operations Research | 2013-09-16 | Paper |
Measures of problem uncertainty for scheduling with interval processing times
OR Spectrum | 2013-08-07 | Paper |
Complexity of dissociate set problems in some hereditary classes of graphs
Doklady Natsional'noĭ Akademii Nauk Belarusi | 2013-07-10 | Paper |
A note on the paper `Single machine scheduling problems with financial resource constraints: some complexity results and properties' by E.R. Gafarov et al.
Mathematical Social Sciences | 2013-05-10 | Paper |
Soft due window assignment and scheduling of unit-time jobs on parallel machines
4OR | 2013-02-18 | Paper |
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
Annals of Operations Research | 2012-11-15 | Paper |
| Inverse problems with Poisson data: Tikhonov-type regularization and iteratively regularized Newton methods. | 2012-09-26 | Paper |
A note on a single machine scheduling problem with generalized total tardiness objective function
Information Processing Letters | 2012-03-09 | Paper |
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
Optimization | 2012-01-18 | Paper |
The complexity of dissociation set problems in graphs
Discrete Applied Mathematics | 2011-08-10 | Paper |
Single machine scheduling problems with financial resource constraints: some complexity results and properties
Mathematical Social Sciences | 2011-08-04 | Paper |
Algorithms for some maximization scheduling problems on a single machine
Automation and Remote Control | 2011-01-03 | Paper |
Minimizing total weighted completion time with uncertain data: a stability approach
Automation and Remote Control | 2011-01-03 | Paper |
Scheduling with multiple servers
Automation and Remote Control | 2011-01-03 | Paper |
Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev
Automation and Remote Control | 2011-01-03 | Paper |
A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
Computers & Mathematics with Applications | 2010-06-28 | Paper |
Parallel machine scheduling problems with a single server
Mathematical and Computer Modelling | 2010-05-06 | Paper |
Minimizing the number of machines for scheduling jobs with equal processing times
European Journal of Operational Research | 2009-12-07 | Paper |
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
Mathematical and Computer Modelling | 2009-10-12 | Paper |
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Mathematical and Computer Modelling | 2009-07-19 | Paper |
On a parallel machine scheduling problem with equal processing times
Discrete Applied Mathematics | 2009-06-30 | Paper |
Preemptive scheduling on uniform machines to minimize mean flow time
Computers & Operations Research | 2009-05-19 | Paper |
| scientific article; zbMATH DE number 5543678 (Why is no real title available?) | 2009-04-14 | Paper |
| The problem of minimizing the weighted number of late jobs to meet strict deadlines and due processing times. | 2009-03-29 | Paper |
| Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length | 2009-02-03 | Paper |
Hamiltonian properties of triangular grid graphs
Discrete Mathematics | 2009-01-28 | Paper |
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Computers & Operations Research | 2008-11-07 | Paper |
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
European Journal of Operational Research | 2008-04-24 | Paper |
Complexity of shop-scheduling problems with fixed number of jobs: a survey
Mathematical Methods of Operations Research | 2007-11-14 | Paper |
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Computers & Operations Research | 2007-10-10 | Paper |
A note on the two machine job shop with the weighted late work criterion
Journal of Scheduling | 2007-05-15 | Paper |
Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy
European Journal of Operational Research | 2006-12-07 | Paper |
KI 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Batching work and rework processes with limited deterioration of reworkables
Computers & Operations Research | 2006-01-10 | Paper |
Positive half-products and scheduling with controllable processing times
European Journal of Operational Research | 2005-04-21 | Paper |
The two-machine flow-shop problem with weighted late work criterion and common due date
European Journal of Operational Research | 2005-04-21 | Paper |
| scientific article; zbMATH DE number 2159453 (Why is no real title available?) | 2005-04-19 | Paper |
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
Computers & Operations Research | 2005-02-23 | Paper |
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
Mathematical and Computer Modelling | 2005-02-22 | Paper |
Two-machine flow shop scheduling with nonregular criteria
JMMA. Journal of Mathematical Modelling and Algorithms | 2005-01-17 | Paper |
Mean flow time minimization with given bounds of processing times
European Journal of Operational Research | 2004-11-22 | Paper |
Two-machine open shop scheduling with secondary criteria
International Transactions in Operational Research | 2004-08-10 | Paper |
Open shop scheduling problems with late work criteria.
Discrete Applied Mathematics | 2004-01-26 | Paper |
Complexity results for parallel machine problems with a single server
Journal of Scheduling | 2003-02-23 | Paper |
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
Journal of Heuristics | 2002-12-15 | Paper |
Scheduling Problems and Mixed Graph Colorings
Optimization | 2002-11-28 | Paper |
A heuristic algorithm for minimizing mean flow time with unit setups
Information Processing Letters | 2002-07-14 | Paper |
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Computers & Operations Research | 2002-07-11 | Paper |
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
RAIRO. Operations Research | 2002-06-16 | Paper |
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
RAIRO. Operations Research | 2002-06-16 | Paper |
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
RAIRO. Operations Research | 2002-06-16 | Paper |
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
Mathematical and Computer Modelling | 2002-05-05 | Paper |
scientific article; zbMATH DE number 1731177 (Why is no real title available?)
IJMA. International Journal of Mathematical Algorithms | 2002-04-17 | Paper |
Local search heuristics for two-stage flow shop problems with secondary criterion
Computers & Operations Research | 2002-02-13 | Paper |
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
Mathematical and Computer Modelling | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1594559 (Why is no real title available?) | 2001-07-02 | Paper |
| scientific article; zbMATH DE number 1594558 (Why is no real title available?) | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1594554 (Why is no real title available?) | 2001-05-06 | Paper |
On the application of insertion techniques for job shop problems with setup times
RAIRO - Operations Research | 2000-08-24 | Paper |
On the application of insertion techniques for job shop problems with setup times
RAIRO - Operations Research | 2000-08-24 | Paper |
| scientific article; zbMATH DE number 1301840 (Why is no real title available?) | 2000-05-25 | Paper |
Complexity of mixed shop scheduling problems: A survey
European Journal of Operational Research | 2000-03-19 | Paper |
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
Annals of Operations Research | 2000-01-11 | Paper |
Heuristics for generalized shop scheduling problems based on decomposition
International Journal of Production Research | 1999-09-09 | Paper |
Batch scheduling with deadlines on parallel machines
Annals of Operations Research | 1999-03-07 | Paper |
On the calculation of the stability radius of an optimal or an approximate schedule
Annals of Operations Research | 1998-12-06 | Paper |
Optimal makespan scheduling with given bounds of processing times
Mathematical and Computer Modelling | 1998-09-07 | Paper |
A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
Operations Research Letters | 1998-07-06 | Paper |
Single machine scheduling with deadlines, release and due dates
Optimization | 1998-02-05 | Paper |
On the solution of determinantal systems of linear inequalities
Optimization | 1997-08-27 | Paper |
Stability of a schedule minimizing mean flow time
Mathematical and Computer Modelling | 1997-08-03 | Paper |
Improving local search heuristics for some scheduling problems. II
Discrete Applied Mathematics | 1997-04-21 | Paper |
Adaptive scheduling algorithm based on mixed graph model
IET Control Theory & Applications | 1996-11-25 | Paper |
Heuristics for permutation flow shop scheduling with batch setup times
OR Spektrum | 1996-10-31 | Paper |
single Machine Preemptive Scheduling With Special Cost Functions1
Optimization | 1996-10-30 | Paper |
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
RAIRO - Operations Research | 1996-07-24 | Paper |
Improving local search heuristics for some scheduling problems. I
Discrete Applied Mathematics | 1996-07-07 | Paper |
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
The Journal of the Operational Research Society | 1996-04-29 | Paper |
A strongly polynomial algorithm for a new class of linear inequalities1
Optimization | 1995-06-21 | Paper |
Optimal schedules with infinitely large stability radius∗
Optimization | 1995-06-21 | Paper |
Insertion techniques for the heuristic solution of the job shop problem
Discrete Applied Mathematics | 1995-05-17 | Paper |
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
Discrete Applied Mathematics | 1995-05-17 | Paper |
A branch and bound algorithm for minimizing weighted completion times with deadlines
Optimization | 1995-04-20 | Paper |
Constructive heuristic algorithms for the open shop problem
Computing | 1994-09-26 | Paper |
On the heuristic solution of the permutation flow shop problem by path algorithms
Computers & Operations Research | 1994-08-18 | Paper |
| scientific article; zbMATH DE number 569956 (Why is no real title available?) | 1994-05-18 | Paper |
A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem]
European Journal of Operational Research | 1994-04-12 | Paper |
Scheduling unit time open shops to minimize the weighted number of late jobs
Operations Research Letters | 1994-04-06 | Paper |
On the combinatorial structure of the permutation flow shop problem
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research | 1992-06-25 | Paper |
Some relations between neighbourhood graphs for a permutation problem
Optimization | 1992-06-25 | Paper |
A locally optimal insertion heuristic for a one-machine scheduling problem
RAIRO - Operations Research | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4156186 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4170626 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4039626 (Why is no real title available?) | 1988-01-01 | Paper |
Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
Optimization | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4020829 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041654 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3982899 (Why is no real title available?) | 1986-01-01 | Paper |
On the method of interchanging networks for permutation problems
Optimization | 1986-01-01 | Paper |
