Minimizing the makespan on two identical parallel machines with mold constraints
In: Computers & operations research: an international journal - Amsterdam [u.a.]: Elsevier, Bd. 105.2019, S. 141-155

The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty - two robust bi-objective models
In: Applied mathematical modelling: simulation and computation for engineering and environmental systems - Amsterdam [u.a.]: Elsevier Science, Bd. 70.2019, S. 605-625

Analysis of particle collisions in restricted spaces using hard spheres and the method of molecular dynamics
In: Zyrnyk naukovych pracʹ za materialami miz̆naroduoi naukovo-praktic̆noi Internet-konferencii \"Modeljuvannja ta informacijni technologiivnauci, technici ta osviti\": 21-22 lystopada 2018 poku - Chakiv: Chadu, S. 29-32

Modeling software for Industry 4.0
In: Zyrnyk naukovych pracʹ za materialami miz̆naroduoi naukovo-praktic̆noi Internet-konferencii \"Modeljuvannja ta informacijni technologiivnauci, technici ta osviti\": 21-22 lystopada 2018 poku - Chakiv: Chadu, S. 13-15

A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespan or mean flow time
In: Journal of advanced manufacturing systems: JAMS - Singapore [u.a.]: World Scientific Publ, Bd. 17.2018, 4, S. 461-486

A scheduling extension scheme of the earliest deadline first policy for hard real-time uniprocessor systems integrated on POSIX threads based on linux
In: International journal of computer systems science & engineering - London: CRL, Bd. 33.2018, S. 31-40

Aspekti timc̆asovich obmez̆enʹ pri vimīrjuvannī kīberfīc̆kīch sistem v promiclovostī
In: Visnyk Charkivsʹkogo nacionalʹnogo avtomobilʹno-dorožnʹnogo universytetu - Charʹkov, Bd. 83.2018, S. 107-115

Filling of irregular channels with round cross-section - modeling aspects to study the properties of porpus materials
In: Materials - Basel: MDPI, Vol. 11.2018, 10, Art. 1905, insgesamt 17 S.

Incorporating supplier selection and order allocation into the vehicle routing and multi-cross-dock scheduling problem
In: International journal of production research - London [u.a.]: Taylor & Francis, 2018

Scheduling in manufacturing systems: new trends and perspectives
In: International journal of production research - London [u.a.]: Taylor & Francis, Bd. 56.2018, 19, S. 6333-6335

Special issue on algorithms for scheduling problems
In: Algorithms - Basel, Vol. 11.2018, 6, Art. 87, insgesamt 4 S.

Zītknennja c̆astinok u obmez̆enomu prostorī pri analīzī moleku ljarnimi dinmīc̆nimi metogami
In: Visnyk Charkivsʹkogo nacionalʹnogo avtomobilʹno-dorožnʹnogo universytetu - Charʹkov, Bd. 83.2018, S. 117-124

A permutation-based neighborhood for the blocking job-shop problem with total tardiness minimization
In: Operations Research Proceedings 2017: selected papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universität Berlin, Germany, September 6-8, 2017 - Cham: Springer International Publishing, S. 581-586, 2018

Algorithms for scheduling problems
In: Belgrade: MDPI, 2018, XIV, 194 Seiten, ISBN 978-3-03897-119-1 ; [This is a reprint of articles from the Special Issue published online in the open access journal Algorithms (ISSN 1999-4893)]

Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
In: Magdeburg: Universität, Fakultät für Mathematik, 2018, 15 Seiten, Diagramme - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2018,Nr.06)

On an equipment heating scheduling problem
In: Magdeburg: Universität, Fakultät für Mathematik, 2018, 7 Seiten, Diagramme - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2018,Nr.03)

Proactive scheduling and reactive real time control in Industry 4.0 manufacturing systems
In: Magdeburg: Universität, Fakultät für Mathematik, 2018, 35 Seiten, Illustrationen, Tabellen - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2018,Nr.01) ; [Literaturverzeichnis: Seite 28-31]

Two-machine job-shop scheduling with one equal-length operation per job on each machine
In: Magdeburg: Universität, Fakultät für Mathematik, 2018, 10 Seiten - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2018,Nr.07)

A batch sequencing model for a semiconductor packaging company
In: Engineering Letters - Hong Kong, Bd. 25.2017, 2, S. 205-213

A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 2 and multiplicity at most 3 in the class of threshold graphs
In: Discussiones mathematicae / Graph theory - Warsaw: De Gruyter Open, Bd. 37.2017, 1

Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
In: Journal of scheduling: JOS - Dordrecht [u.a.]: Springer Science + Business Media, insges. 17 S., 2017

Flexible job shop scheduling with lot streaming and sublot size optimisation
In: International journal of production research - London [u.a.]: Taylor & Francis, insges. 21 S., 2017

Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
In: Optimization letters - Berlin: Springer, Bd. 11.2017, 1, S. 165-177

The optimality box in uncertain data for minimising the sum of the weighted job completion times
In: International journal of production research - London [u.a.]: Taylor & Francis, insges. 27 S., 2017

Material handling tools for a discrete manufacturing system - a comparison of optimization and simulation
In: 2017 International Conference on Circuits, System and Simulation (ICCSS 2017): July 14-17, 2017, London, UK - Piscataway, NJ: IEEE, S. 97-102 ; [Konferenz: 2017 International Conference on Circuits, System and Simulation, ICCSS 2017, London, UK, July 14-17, 2017]

Performance analysis of material handling tools for a discrete manufacturing system
In: Magdeburg, Universität, Fakultät für Mathematik, 2017, 19 Seiten, Illustrationen - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2017,Nr.05)

The optimality box in uncertain data for minimizing the sum of the weighted completion times of the given jobs
In: Magdeburg, Universität, Fakultät für Mathematik, 2017, 23 Seiten - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2017,Nr.01)

A dynamic model and algorithm for short-term supply chain scheduling in the smart factory industry 4.0
In: International journal of production research - London [u.a.]: Taylor & Francis, Bd. 54.2016, 2, S. 386-402, 54 2016 2 386-402

A new effective dynamic program for an investment optimization problem
In: Automation and remote control - Dordrecht [u.a.]: Springer Science + Business Media B.V, Bd. 77.2016, 9, S. 1633-1648

Graphs with maximal induced matchings of the same size
In: Discrete applied mathematics - [S.l.]: Elsevier, Bd. 216.2016, 1, S. 15-28

Integrated demand-responsive scheduling of maintenance and transportation operations in military supply chains
In: International journal of production research - London [u.a.]: Taylor & Francis, Bd. 54.2016, 19, S. 5798-5810

Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
In: Engineering optimization - London: Taylor & Francis, Bd. 48.2016, 1, S. 173-183

Mnogogrannik optimalʹnosti raspisanija, minimizirujuščego summu vzvešennych momentov zaveršenija obsluživanija trebovanij
In: Vesci Nacyjanal\'naj Akadėmii Navuk Belarusi / Seryja fizika-matėmatyčnych navuk - Minsk: Belaruskaja Navuka, Bd. 4.2016, 4, S. 103-111

On a generalized single machine scheduling problem with time-dependent processing times
In: IFAC-PapersOnLine - Frankfurt: Elsevier, Bd. 49.2016, 12, S. 226-230

Recent advances on modeling of structures of multi-component mixtures using a sphere packing approach
In: International journal of nanotechnology: IJNT - Genève: Inderscience Enterprise, Bd. 13.2016, 1/3

Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions
In: International journal of production research - London [u.a.]: Taylor & Francis, Bd. 54.2016, 11, S. 3397-3413

Upravlenie v socialʹno-ėkonomic̆eskich, mediko-biologiec̆eskich sistemach
In: Automation and remote control: a translation of \"Avtomatika i Telemekhanika\" - New York, NY: Pleiades Publ, Bd. 9.2016, S. 150 - 166

Flexible planning model for a high tech company with high volume - high mixture
In: Proceedings of the World Congress on Engineering and Computer Science, WCECS 2016 - Newswood Limited, S. 957-962 ; [Kongress: World Congress on Engineering and Computer Science, WCECS 2016, San Francisco, USA, 19 - 21 October, 2016]

Mathematical methods and heuristic algorithms for scheduling parallel machines with a single server
In: Tanaevskie čtenija: doklady sedʹmoj meždunarodnoj naučnoj konferencii (28-29 marta 2016, Minsk) - Minsk: OIPI NAN Belarusi, S. 212-216 ; [Kongress: 7. Meždunarodnaja naučnaja konferencija, Minsk, 28.-29.03.2016]

Metod "napolenenija množestv" res̆enija zadac̆ teorii raspisanij dlja odnogo pribora
In: Tanaevskie čtenija: doklady sedʹmoj meždunarodnoj naučnoj konferencii (28-29 marta 2016, Minsk) - Minsk: OIPI NAN Belarusi, S. 4-8 ; [Kongress: 7. Meždunarodnaja naučnaja konferencija, Minsk, 28.-29.03.2016]

Computers & operations research - and their applications to problems of world concern : an international journal
In: Braunschweig [u.a.], Pergamon Press, anfangs, f, 1974 ; [Herausgeberschaft für Vol. 36, 2009, Heft 2]

A refresher course in mathematics
In: Kopenhagen, Bookboon, 2016, 1 Online-Ressource (284 p)

A scheduling scheme extension of the earliest deadline first policy for hard real-time uniprocessor systems integrated on POSIX threads based on Linux
In: Magdeburg, Universität, Fakultät für Mathematik, 2016, 20 Seiten, Illustrationen - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2016,Nr.7)

Genetic algorithms for hybrid job-shop problems with minimizing the makespan and mean flow time
In: Magdeburg, Universität, Fakultät für Mathematik, 2016, 23 Seiten - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2016,Nr.2)

Heuristic algorithms to maximize the weighted revenue and weighted number of jobs processed on parallel uniform machines
In: Magdeburg, Universität, Fakultät für Mathematik, 2016, 25 Seiten, Diagramme - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2016,Nr.4)

Models and optimization approaches for flexible job shop scheduling with lot sizing
In: Magdeburg, Universität, Fakultät für Mathematik, 2016, 29 Seiten, Diagramme - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2016,Nr.10)

Consistent patterns of encapsulating hard spheres in restricted volumes - modeling the confinement of nanoparticles in nanoporous matrices
In: 5th International Colloids Conference - Colloid and Interface Science for a Brighter Futur: 21 - 24 June 2015, Amsterdam, The Netherland - Amsterdam, 2015, Art. P082

Single machine scheduling - finding the Pareto Set for jobs with equal processing times with respect to criteria L_max and C_max
In: MISTA 2015: proceedings of the 7th Multidisciplinary International Conference on Scheduling: Theory and Application : 25th - 28th August 2015, Prague, Czech Republic, S. 797-800

A minimal dominant set of critical paths for the uncertain project-network
In: International journal of operational research/Nepal: IJORN - Kathmandu: ORSN, Bd. 4.2015, S. 19-32

Optimalʹnoe planirobanie rabočego vremeni kak obsluživanie trebovanij s intervalʹnymi dlitelʹnostjami
In: Ėkonomika, modelirovanie, prognozirovanie: sbornik naučnych trudov - Minsk, Bd. 9.2015, S. 96-104

Packing of monosized spheres in a cylindrical container - models and approaches
In: Revista mexicana de física - México: UNAM, Bd. 61.2015, 1, S. 20-27

Packing of monosized spheres in a cylindrical container: Models and approaches
In: Revista mexicana de física / E - México: Soc, Bd. 61.2015, 1, S. 20-27

Tessellation methods for modeling the material structure
In: Applied mechanics and materials : AMM. - [S.l.] : Scientific.Net, Bd. 756.2015, S. 426-435, 2004

Using mathematical tessellation to model spherical particle packing structures
In: International journal of mathematics, game theory, and algebra - Huntington, NY: Nova Science Publishers, Bd. 24.2015, 2/3, S. 249-275

Using mathematical tessellation to model spherical particle packing structures
In: Advances in mathematics research - Hauppauge, NY: Nova Science Publ, Bd. 20.2015, S. 1-26

A comparison of approaches to modeling train scheduling problems as job-shops with blocking constraints
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 25 S., Ill. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,18)

An integrated approach for maintenance and delivery scheduling in military supply chains
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 23 S., graph. Darst. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,20)

Approaches for planning the ISS cosmonaut traning
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 33 S., Ill. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,12)

Finding the pareto set for a bi-criteria scheduling problem on a single machine with equal processing times
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 10 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,3)

Modeling of monosized sphere packings into cylinders
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 22 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,4)

Modeling of spherical particle packing structures using mathematical tessellation
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 29 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,7)

Modeling of the material structure using Voronoi diagrams and tessellation methods
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 11 S., graph. Darst. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,1)

Multi-sized sphere packings - models and recent approaches
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 21 S., Ill. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,2)

Planning in time-management as sequencing given jobs with interval processing times
In: 2015, Online-Ressource - (Technical Report; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,10)

Planning in time-management as sequencing given jobs with interval prozessing times
In: Magdeburg: Univ., Fak. für Mathematik, 2015, 13 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2015,10)

A graphical approach to solve an investment optimization problem
In: Journal of mathematical modelling and algorithms in operations research: JMMA - Dordrecht: Springer Science + Business Media B.V, Bd. 13.2014, 4, S. 597-614

A hybridization of harmony search and simulated annealing to minimize mean flow time for the two-machine scheduling problem with a single server
In: International journal of operational research/Nepal. - Kathmandu : ORSN, Bd. 3.2014, 1, S. 9-26

A new graphical approach for solving single-machine scheduling problems approximately
In: International journal of production research. - London [u.a.] : Taylor & Francis, Bd. 52.2014, 13, S. 3762-3777

Approximability results for the resource-constrained project scheduling problem with a single type of resources
In: Annals of operations research. - Dordrecht [u.a.] : Springer Science + Business Media B.V, Bd. 213.2014, 1, S. 115-130

Block models for scheduling jobs on two parallel machines with a single server
In: Computers & operations research. - Amsterdam [u.a.] : Elsevier, Bd. 41.2014, S. 94-97

Guest editorial
In: International journal of production research. - London [u.a.] : Taylor & Francis, Bd. 52.2014, 13, S. 3755-3757

Lower and upper bounds for the total product rate variation problem
In: Neural, parallel & scientific computations - Atlanta, Ga.: Dynamic Publ., Bd. 22.2014, 3, S. 389-398

Minimising interference for scheduling two parallel machines with a single server
In: International journal of production research - London [u.a.]: Taylor & Francis, Bd. 52.2014, 24, S. 7148-7158

Minimizacija summarnogo vremeni obsluživanija dlja sistemy s dvumja priborami i odnim severom
In: Informatika. - Minsk, Bd. 41.2014, 1, S. 15-24

Minimizing total weighted completion time approximately for the parallel machine problem with a single server
In: Information processing letters. - Amsterdam [u.a.] : Elsevier, 2014

Scheduling unrelated machines with two types of jobs
In: International journal of production research. - London [u.a.] : Taylor & Francis, Bd. 52.2014, 13, S. 3793-3801

Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server
In: International journal of production research. - London [u.a.] : Taylor & Francis, Bd. 52.2014, 13, S. 3778-3792

Time management based on two-machine flowshop scheduling with uncertain processing times
In: International journal information technologies & knowledge. - Sofija : ITHEA, Bd. 8.2014, 3, S. 212-224

A stability approach to sequencing and scheduling under uncertainty
In: Sequencing and scheduling with inaccurate data. - Hauppauge, New York : Nova Science Publishers, Inc, S. 283-343, 2014

Sequencing and scheduling with inaccurate data
In: New York, Nova Science Publ., 2014, X, 432 S., graph. Darst. - (Applied statistical science), ISBN 978-1-62948-677-2 ; [Includes bibliographical references and index]

Special issue: New developments in scheduling and manufacturing
In: Abingdon, Taylor & Francis, 2014 - (International journal of production research : 52.2014,13) ; [Enth. 23 Beitr.]

A minimal dominant set of critical paths for the project-network with interval activity durations
In: Magdeburg, Univ., Fak. für Mathematik, 2014, 16 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2014,12)

Minimizing the makespan for the two-machine scheduling problem with a single server - two algorithms for very large instances
In: Magdeburg, Univ., Fak. für Mathematik, 2014, 19 S., graph. Darst. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2014,1)

Scheduling two parallel machines with a single server to minimize forced idle time
In: Magdeburg, Univ., Fak. für Mathematik, 2014, 16 S., graph. Darst. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2014,5)

Time management including two-machine flowshop scheduling with interval processing times
In: Magdeburg, Univ., Fak. für Mathematik, 2014, 15 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2014,4)

A note on the paper Single machine scheduling problems with financial resource constraints: some complexity results and properties by E.R. Gafarov et al.
In: Mathematical social sciences. - Amsterdam : Elsevier Science, Bd. 65.2013, 3, S. 232

A graphical algorithm for solving an investment optimization problem
In: MISTA 2013. - MISTA, S. 290-299 ; Kongress: MISTA Conference; 6 (Gent, Belgium) : 2013.08.27-29

A graphical approach for solving single machine problems approximately
In: IFAC MIM \'2013. - St. Peterburg, S. 1356-1361 ; Kongress: MIM 2013; (Saint Petersburg) : 2013.06.19-21

Makespan minimization for a two-machine scheduling problem with a single server
In: IFAC MIM \'2013. - St. Peterburg, S. 1380-1385 ; Kongress: MIM 2013; (Saint Petersburg) : 2013.06.19-21

Solving a job-shop problem by an adaptive algorithm based on learning
In: IFAC MIM \'2013. - St. Peterburg, S. 1368-1373 ; Kongress: MIM 2013; (Saint Petersburg) : 2013.06.19-21

Solving an investment problem by an improved graphical approach
In: 22th International Conference on Production Research. - Iguassu Falls; 2013, Paper ID 121, insgesamt 6 S. ; Kongress: ICPR; 22 (Iguassu Falls, Brazil) : 2013.07.28-08.01

Erratum to: Minimizing total tardiness on parallel machines with preemptions
In: Journal of scheduling. - Dordrecht [u.a.] : Springer Science + Business Media, Bd. 16.2013, 4, S. 439-441

Fast edge-orientation heuristics for job-shop scheduling problems with applications to train scheduling
In: International journal of operational research/Nepal. - Kathmandu : ORSN, Bd. 2.2013, 1, S. 19-32

Measures of problem uncertainty for scheduling with interval processing times
In: OR spectrum. - Berlin : Springer, Bd. 35.2013, 3, S. 659-689

Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
In: Theoretical computer science. - Amsterdam [u.a.] : Elsevier, Bd. 501.2013, S. 72-81

Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
In: International journal of production research. - London [u.a.] : Taylor & Francis, Bd. 51.2013, 23/24, S. 7105-7119

Single machine total tardiness maximization problems - complexity and algorithms
In: Annals of operations research. - Dordrecht [u.a.] : Springer Science + Business Media B.V, Bd. 207.2013, 1, S. 121-136

A graphical approach for solving single machine scheduling problems approximately
In: 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013. - IFAC, S. 1340-1345

A survey of genetic algorithms for shop scheduling problems
In: Heuristics. - New York, NY : Nova Publ., S. 161-122, 2013

Solving a job-shop scheduling problem by an adaptive algorithm based on learning
In: 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013. - IFAC, S. 1352-1357

The stability box for minimizing total weighted flow time under uncertain data
In: Simulation and modeling methodologies, technologies and applications. - Berlin [u.a.] : Springer, S. 39-55, 2013 - (Advances in Intelligent Systems and Computing; 197)

A comparative computational study of the effect of the preliminary reduction for the classical and multiprocessor job-shop scheduling problems
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 23 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,5)

A dynamic model and an algorithm for flexible flow shop scheduling with continuous flows and discrete assignments
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 26 S.: graph. Darst. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,16)

A finite characterization of intersection graphs of hypergraphs with a rank of at Most 3 and a multiplicity of at Most 2 in the class of threshold graphs
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 13 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,3)

A hybrid harmony search/simulated annealing algorithm for minimizing mean flow time on two identical parallel machines with a single server
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 17 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,22)

An attainable set-based approach to schedule robustness analysis in continuous time
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 19 S.: graph. Darst. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,15)

An exact solution procedure for the total product rate variation problem
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 25 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,27)

Block models for scheduling jobs on two parallel machines with a single server
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 9 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,1)

Minimizing mean flow time for the two-machine scheduling problem with a single server
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 14 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,12)

Minimizing total weighted completion time approximately for the paraellel machine problem with a single server
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 8 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,13)

Solving an investment optimization problem by an improved graphical approach
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 20 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,2)

Two heuristics for minimizing the makespan for the two-machine scheduling problem with a single server
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 20 S.: graph. Darst. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,8)

Upper and lower bounds for the total product rate variation problem
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 9 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,28)

Using a stability method for scheduling and sequencing with interval data
In: Magdeburg: Univ., Fak. für Mathematik, 2013; 61 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,9)

A combinatorial approximation algorithm for selecting the gate sizes from finite sets in VLSI circuits
In: International journal of operational research/Nepal. - Kathmandu : ORSN, Bd. 1.2012, 1, S. 33-48

Soft due window assignment and scheduling of unit-time jobs on parallel machines
In: 4OR. - Berlin : Springer, Bd. 10.2012, 4, S. 347-360

A graphical approach to solve combinatorial problems - algorithms and some computational results
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, 2012

A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 393-398, 2012

Calculation of the stability radius of an optimal line balance
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 192-197, 2012

Graphs with maximal induced matchings of the same size
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 518-523, 2012

Heuristic algorithms for a job-shop problem with minimizing total job tardiness
In: III. International Conference on Optimization Methods and Applications, (OPTIMA-2012). - Moscow, S. 245-249 ; Kongress: OPTIMA-2012; 3 (Costa da Caparica, Portugal) : 2012.09.23-30

Job-shop problems with objectives appropriate for train scheduling in a single-track railway
In: Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications. - [S.l.] : SciTePress, S. 425-430, 2012 ; Kongress: SIMULTECH; 2 (Rome) : 2012.07.28-31

Minimizing a regular function on uniform machines with ordered completion times
In: Linear programming. - New York : Nova Science Publ., S. 159-172, 2012

Near to optimal size selection in combinatorial circuits
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 524-529, 2012

Polynomial algorithms for scheduling jobs with two processing times on unrelated machines
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 393-397, 2012

Scheduling under uncertainty
In: PMS 2012. - Leuven, S. 67-70 ; Kongress: PMS 2012; 13 (Leuven, Belgium) : 2012.04.01-04

Search on an enumeration tree in multiprocessor job-shop problem
In: 14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM\'12. - IFAC-PapersOnline, S. 381-386, 2012

Special issue: scheduling in manufacturing systems - [... a track 'Scheduling in Manufacturing Systems' presented at the 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2009) which was held on June 3 - 5, 2009 ... in Moscow/Russia]
In: Amsterdam [u.a.]: Elsevier, 2012; S. 1195 - 1303: graph. Darst. - (Computers & operations research; 39.2012,6) ; Kongress: Track \'Scheduling in Manufacturing Systems\'; 13 (Moscow) : 2009.06.03-05 ; IFAC Symposium on Information Control Problems in Manufacturing; 13 (Moscow) : 2009.06.03-05 ; INCOM; 13 (Moscow) : 2009.06.03-05

A graphical approach to solve an investment optimization problem
In: Magdeburg: Univ., Fak. für Mathematik, 2012; 27 S. - (Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2012,15)

Minimizing total tardiness on parallel machines with preemptions
In: Journal of scheduling. - Norwell, Mass : Springer Science + Business Media, Bd. 15.2012, 2, S. 193-200

Scheduling problems with financial resource constraints
In: II. International Conference Optimization and Applications, (OPTIMA-2011). - Montenegro : Univ., S. 82-85 ; Kongress: OPTIMA 2011; 2 (Petrovac, Montenegro) : 2011.2011.09.25-10.02

The stability box in interval data for minimizing the sum of eighted completion time
In: Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications. - [Setúbal] : SciTePress, S. 14-23, 2011 ; Kongress: SIMULTECH; 1 (Noordwijkerhout, The Netherland) : 2011.07.29-31

A note on a single machine scheduling problem with generalized total tardiness objective function
In: Information processing letters. - Amsterdam [u.a.] : Elsevier, Bd. 112.2011, 3, S. 72-76, 2012

Parallel machine problems with equal processing times - a survey
In: Journal of scheduling. - Norwell, Mass. : Springer Science + Business Media, Bd. 14.2011, 5, S. 435-444

Single machine scheduling problems with financial resource constraints: Some complexity results and properties
In: Mathematical social sciences. - Amsterdam : Elsevier Science, 2011

The complexity of dissociation set problems in graphs
In: Discrete applied mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 159.2011, 13, S. 1352-1366

The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
In: Optimization. - Reading [u.a] : Taylor & Francis, Bd. 60.2011, 12, S. 1493-1517

Properties of lower bounds for the RCPSP
In: PMS\'10 . - Tours, S. 191-194, 2010 ; Kongress: PMS\'10; 12 (Tours, France) : 2010.04.26-28

Batching on two facilities dedicated for work and rework
In: Tanaevskie ctenija . - Minsk : OIPI NAN Belarusi, ISBN 978-985-674461-0, S. 164-168, 2010 ; Kongress: Mezdunarodnoj naucnoj konferencii; (Minsk) : 2010.03.29-30

Minimizacija separabel'noj vypukloj funkcii v obsluzivajuscej sisteme s neidenticuymi priborami i dopustimymi preryvanijami
In: Tanaevskie ctenija . - Minsk : OIPI NAN Belarusi, ISBN 978-985-674461-0, S. 80-84, 2010 ; Kongress: Mezdunarodnoj naucnoj konferencii; (Minsk) : 2010.03.29-30

Avtomatika i telemechanika
In: Moskva, ISSN: 0005-2329 ; 2010,10

Algorithms for some maximization scheduling problems on a single machine
In: Automation and remote control . - New York, NY : Pleiades Publ., Bd. 71.2010, 10, S. 2070-2084

Batching for work and rework processes on dedicated facilities to minimize the makespan
In: Omega . - Oxford [u.a.] : Elsevier, Bd. 38.2009/10, 6, S. 522-527

Foreword to the thematical issue devoted to the seventieth anniversary of Academician V.S. Tanaev
In: Automation and remote control . - New York, NY : Pleiades Publ., Bd. 71.2010, 10, S. 2019-2020

Minimizing total weighted completion time with uncertain data - a stability approach
In: Automation and remote control . - New York, NY : Pleiades Publ., Bd. 71.2010, 10, S. 2038-2057

Scheduling with multiple servers
In: Automation and remote control . - New York, NY : Pleiades Publ., Bd. 71.2010, 10, S. 2109-2121

Algoritmy resenija zadac maksimizacii summaruogo zapazdyvanija i maksimizaciikolicestva zapazdyvajuscich trebovanij dlja oduogo pridora
In: Avtomatika i telemechanika . - Moskva, 10, S. 63-79, 2010 ; [Tematiceskij vypusk]

Minimizacija summaruogo vzvesennogo vremeni obsluzivanija trebovanij s neopredelennymi dannymi - metod, osnovannyj na ustojcivosti
In: Avtomatika i telemechanika . - Moskva, 10, S. 26-49, 2010 ; [Tematiceskij vypusk]

Postroenie optimal'nych raspisanije dlja obsluzivajuscich sistem s mnozestbom serverov
In: Avtomatika i telemechanika . - Moskva, 10, S. 107-121, 2010 ; [Tematiceskij vypusk]

Predislovie k tematiceskomu vypusku, posvjascennomu 70. letiju akademika V. S. Tanaeva
In: Avtomatika i telemechanika . - Moskva, 10, S. 3-5, 2010 ; [Tematiceskij vypusk]

Scheduling under uncertainty - theory and algorithms
In: Minsk: Belorusskaya Nauka; 324 S.: graph. Darst., ISBN 978-985-081173-8, 2010 ; [Literaturverz. S. 295 - 320]

Hierarchical scheduling of mobile robots in production-transportation supply chains
In: 13th IFAC Symposium on Information Control Problems in Manufacturing . - Moscow, S. 790-795, 2009 ; Kongress: INCOM 2009; 13 (Moscow) : 2009.06.03-05

On the complexity of dissociation set problems in graphs
In: 13th IFAC Symposium on Information Control Problems in Manufacturing . - Moscow, S. 1036-1040, 2009 ; Kongress: INCOM 2009; 13 (Moscow) : 2009.06.03-05

Parallel machine problems with equal processing times
In: MISTA 2009 . - Dublin, S. 458-468 ; Kongress: MISTA Conference; 4 (Dublin) : 2009.08.10-12

Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times
In: 13th IFAC Symposium on Information Control Problems in Manufacturing . - Moscow, S. 1500-1505, 2009 ; Kongress: INCOM 2009; 13 (Moscow) : 2009.06.03-05

Scheduling jobs with equal processing times
In: 13th IFAC Symposium on Information Control Problems in Manufacturing . - Moscow, S. 1245-1250, 2009 ; Kongress: INCOM 2009; 13 (Moscow) : 2009.06.03-05

A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
In: Computers & operations research . - Oxford [u.a.] : Elsevier, Bd. 36.2009, 2, S. 358-378

A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
In: Computers and mathematics with applications . - Oxford [u.a.] : Pergamon Press, Bd. 58.2009, 4, S. 619-631

Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
In: Mathematical and computer modelling . - Oxford [u.a.] : Pergamon Press, Bd. 49.2009, 9/10, S. 2061-2072

Minimizing the number of machines for scheduling jobs with equal processing times
In: European journal of operational research . - Amsterdam : Elsevier, Bd. 199.2009, 2, S. 595-600

On a parallel machine scheduling problem with equal processing times
In: Discrete applied mathematics . - Amsterdam [u.a.] : Elsevier, ISSN 0166-218x, Bd. 157.2009, 4, S. 848-852

Preemptive scheduling on uniform machines to minimize mean flow time
In: Computers & operations research . - Oxford [u.a.] : Elsevier, Bd. 36.2009, 10, S. 2816-2821

Complexity of dissociation det problems in some hereditary classes of graphs
In: Akademija Nauk Belarusi <Minsk> : Doklady Nacional\'noj Akademii Nauk Belarusi . - Minsk : Belaruskaja Navuka, Bd. 53.2009, 3, S. 16-20

Using simulated annealing for open shop scheduling with sum criteria
In: Simulated annealing . - In-tech, ISBN 978-953-761907-7, S. 49-76, 2008

Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
In: The international journal of advanced manufacturing technology . - London : Springer, Bd. 37.2008, 3/4, S. 354-370

Hamiltonian properties of triangular grid graphs
In: Discrete mathematics . - Amsterdam : North-Holland Publ. Co., ISSN 0012-365x, Bd. 308.2008, 24, S. 6166-6188

Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
In: European journal of operational research . - Amsterdam : Elsevier, Bd. 189.2008, 3, S. 856-870

Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; operations research . - Oxford [u.a.] : Elsevier, Bd. 35.2008, 2, S. 574-599

Sequence-dependent setup times in a two-machine job-shop with minimizing the schedule length
In: International journal of operations research . - Taichung City : IJOR, Bd. 5.2008, 1, S. 68-77

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
In: Mathematical and computer modelling . - Oxford [u.a.] : Pergamon Press, Bd. 48.2008, 7/8, S. 1279-1293

Fuzzy LPT algorithms for flexible flow shop problems with unrelated parallel machines for a continuous fuzzy domain
In: Proceedings of the 2007 IE Network National Conference . - Phuket, S. 208-213 ; Kongress: IE Network National Conference; : (Phuket) ; 2007.10.24-26

Fuzzy dispatching rules for flexible flow shop problems with unrelated parallel machines for a continuous fuzzy domain
In: Service value innovation and challenges . - Kaohsiung, ISBN 978-986-011761-5, insges. 10 S., 2007 ; Kongress: Asia Pacific Industrial Engineering &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; Management System; 8 (Kaohsiung) : 2007.12.09-12 ; APIEMS; 8 ; 2007 Chinese Institute of Industrial Engineers Conference; ; CIIE 2007;

A note on the two machine job shop with the weighted late work criterion
In: Journal of scheduling . - Norwell, Mass. : Springer Science + Business Media, Bd. 10.2007, 2, S. 87-95

Complexity of shop-scheduling problems with fixed number of jobs - a survey
In: Mathematical methods of operations research . - Heidelberg : Physica-Verl., Bd. 65.2007, 3, S. 461-481

Constructive and simulated annealing algorithms for hybrid flow shop problems with unrelated parallel machines
In: Thammasat international journal of science and technology . - Bangkok, Bd. 12.2007, 1, S. 31-41

Constructive and tabu search heuristics for hybrid flow shops with unrelated parallel machines and setup times
In: International journal of computational science . - Wanchai : Global Information Publisher, Bd. 1.2007, 2, S. 204-214

Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
In: International journal of production economics . - Amsterdam [u.a.] : Elsevier Science, Bd. 105.2007, 2, S. 345-356

Problem F2||Cmax with forbidden jobs in the first or last position is easy
In: European journal of operational research . - Amsterdam [u.a.] : Elsevier, Bd. 177.2007, 2, S. 1310-1311

A comparison of heuristics for mean flow time open shop scheduling
In: 12. IFAC Symposium on Information Control Problems in Manufacturing; Vol. 3: Operational Research . - Saint Etienne : Ecole Nationale Supérieure des Mines, S. 119-124, 2006 ; Kongress: INCOM 2006; 12 (Saint-Etienne, France) : 2006.05.17-19

Cyclic properties of triangular grid graphs
In: 12. IFAC Symposium on Information Control Problems in Manufacturing; Vol. 3: Operational Research . - Saint Etienne : Ecole Nationale Supérieure des Mines, S. 149-153, 2006 ; Kongress: INCOM 2006; 12 (Saint-Etienne, France) : 2006.05.17-19

Sequence-dependent setup and clean-up times in a two-machine job-shop with minimizing makespan
In: 12. IFAC Symposium on Information Control Problems in Manufacturing; Vol. 3: Operational Research . - Saint Etienne : Ecole Nationale Supérieure des Mines, S. 51-56, 2006 ; Kongress: INCOM 2006; 12 (Saint-Etienne, France) : 2006.05.17-19

Sequencing and tabu search heuristics for hybrid flow shops with unrelated parallel machines and setup times
In: The 7th Asia-Pacific Conference on Industrial Engineering and Management Systems Conference and the 9th Asia Pacific Division Meeting of the International Foundation for Production Research . - Asian Inst. of Technology, ISBN 974-8257-26-6, S. 1330-1342, 2006 ; Kongress: APIEMS 2006; 7 (Bangkok) : 2006.12.17-20

Sequencing heuristics for flexible flow shop scheduling problems with unrelated parallel machines and setup times
In: Proceedings of the 2006 IE Network National Conference . - Bangkok, S. 1-8 ; Kongress: IE Network National Conference; : (Bangkok, Thailand) ; 2006.12.18-19

Solving the hybrid flowshop scheduling problem with unrelated parallel machines and sequence-dependent setup times by simulated annealing algorithm
In: Manufacturing innovation and excellence through research and development . - Kuala Lumpur, S. 640-645, 2006 ; Kongress: International Conference on Manufacturing and Material Processing; 1 (Kuala Lumpur) : 2006.03.14-15 ; AUN/SEED-Net Fieldwise Seminar on Manufacturing and Material Processing; 7 ; ICMM 2006;

Constructive and simulated annealing heuristics for hybrid flow shops with unrelated parallel machines
In: Proceedings of the 3rd OR-CRN Operations Research Conference, Bangkok, Thailand, 31 August - 1 September, 2006 . - Bangkok, ISBN 974-466-168-2, S. 110-121 ; Kongress: OR-CRN Operations Research Conference; 3 (Bangkok) : 2006.08.31-2006.09.01

Mathematics of economics and business
In: unter URL: http://www.gbv.de/dms/bsz/toc/bsz12145200xinh.pdf$mDE-576$nDE-180$qpdf/application$x2009-01-25$304$ABSZ$B2; London [u.a.]: Routledge; XVII, 516 S.: graph. Darst.; 25 cm, ISBN 0415332818, 2006 ; [Litertaturangaben]

Batching work and rework processes with limited deterioration of reworkables
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; operations research . - Amsterdam [u.a.] : Elsevier, Bd. 33/2006, 6, S. 1595-1605

Multicriteria scheduling - theory, models and algorithms, Berlin, Springer, 2002
In: European journal of operational research . - Amsterdam [u.a.] : Elsevier, Bd. 168.2006, 1, S. 275-277

Planning and scheduling in manufacturing and services, New York, Springer, 2005
In: Mathematical methods of operations research . - Berlin : Springer, Bd. 63.2006, S. 187-189

O gamil'tonovych ciklach v grafach triangulirovannoj resetki.
In: Nacional\'naja akademija nauk Belarusi (Veranst.) : ... (Veranst.): Tanaevskie ctenija (Vtoraja naucnaja konferencija Minsk, 28 marta 2005). - doklady. Minsk : NANB, 2005, S. 23 - 27

A comparison of solution procedures for two-machine flow shop schedulding with late work criterion.
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; industrial engineering [Amsterdam] 49(2005), Nr. 4, S. 611 - 624

Positive half-products and scheduling with controllable processing times.
In: European journal of operational research : EJOR [Amsterdam] 165(2005), S. 416 - 422

The two-machine flow-shop problem with weighted late work criterion and common due date.
In: European journal of operational research : EJOR [Amsterdam] 165(2005), S. 408 - 415

Hamiltonian cycles in graphs of triangular grid.
In: Doklady Nacionalnoj Akademii Nauk Belarusi [Minsk] 49(2005), Nr. 5, S. 21 - 25

Metaheuristics for late work minimization in two-machine flow shops with common due date.
In: Furbach, Ulrich (Hrsg.): KI 2005 : advances in artificial intelligence (28th annual german conference on AI Koblenz, Germany September 11 -14 2005). - proceedings. Berlin [u.a.] : Springer, 2005, S. 222 - 234 (Lecture notes in computer science 3698)

Stability of optimal line balance with given station set.
In: Dolgui, Alexandre (Hrsg.) ; Soldek, Jerzy (Hrsg.) ; Zaikin, Oleg (Hrsg.): Supply chain optimisation : product/prcess design, facility location and flow control. New York, NY : Springer, 2005, S. 135 - 149 (Applied optimization 94)

Heuristics for two-machine flow shop problems with earliness and tardiness penaties.
In: International journal of operations and quantitative management : IJOQM [Gary, In.] 10(2004), Nr. 2, S. 125 - 144

Mean flow time minimization with given bounds of processing times.
In: European journal of operational research : EJOR [Amsterdam] 159(2004), Nr. 3, S. 558 - 573

On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties.
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; operations research [Oxford] 31(2004), S. 317 - 345

Open shop scheduling problems with late work criteria.
In: Discrete applied mathematics : DAM [Amsterdam] 134(2004), S. 1 - 24

Scheduling with common due date, earliness and tardiness penalties for multimachine problems : a survey.
In: Mathematical and computer modelling [Oxford] 40(2004), S. 637 - 655

Two-machine flow shop sheduling with nonregular criteria.
In: Journal of mathematical modelling and algorithms [Dordrecht] 3(2004), Nr. 2, S. 123 - 151

Flow shop scheduling with late work criterion.
In: Manandhar, Suresh (Hrsg.) ; ... (Hrsg.): Applied computing, AACC 2004 (2nd Asian applied computing conference Kathmandu, Nepal, October 2004). - proceedings. Berlin : Springer, 2004, S. 68 - 75 (Lecture notes in computer science 3285) . - AACC 2004

Two-machine open shop scheduling with secondary criteria.
In: International transactions in operational research [Oxford] 10(2003), S. 267 - 294

The binary NP-hardness of the two-machine job shop problem with the weighted late work criterion.
In: Institut National des Telecommunications (Veranst.): International network optimization conference (INOC\'2003 Evry-Paris, France October 27-29, 2003). - proceedings. Evry : INT, 2003, S. 101 - 106 (INOC 2003)

Stability of the optimal line balance for a fixed number of stations.
In: Technical University of Szczecin (Veranst.): Production system design, supply chain management and logistics, ACS\'02 (9th International multi-conference Advanced Computer Systems Miedzyzdroje, Poland, October 23 - 25, 2002). - papers. Szczecin, 2002, [8 S.] Unter URL: http://acs.wi.ps.pl/scm (Stand vom: 24.01.2003)

Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness.
In: Journal of heuristics [Boston] 8(2002), S. 415 - 428

Complexity results for parallel machine problems with a single server.
In: Journal of scheduling [Chichester] 5(2002), S. 429 - 457 Unter URL: www.interscience.wiley.com (Stand vom: 29.01.2003)

Heuristics for hybrid flow shops with controllable processing times and assignable due dates.
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; operations research [Oxford] 29(2002), S. 1417 - 1439

Local search heuristics for two-stage flow shop problems with secondary criterion.
In: Computers &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; operations research [Oxford] 29(2002), S. 123 - 149

Scheduling problems and mixed graph colorings.
In: Optimization [Reading] 51(2002), Nr. 3, S. 597 - 624

A heuristic algorithm for minimizing mean flow time with unit setups.
In: Information processing letters [Amsterdam] 79(2001), S. 291 - 296

Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties.
In: Mathematical and computer modelling [Oxford] 33(2001), S. 363 - 383

Minimizing total flow time in a two-machine flowshop problem with minimum makespan.
In: International journal of production economics [Amsterdam] 69(2001), S. 323 - 338

Mixed graph coloring for unit-time job-shop scheduling.
In: International journal of mathematical algorithms [Reading, Mass.] 2(2001), S. 289 - 323

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release : due date intervals.
In: RAIRO, Recherche opérationnelle = Operations Research [Paris] 35(2001), Nr. 1, S. 71 - 83

A branch and bound method for mixed graph coloring and scheduling.
In: Persad, P. (Hrsg.): CARS &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; FOF 2000 (16th International conference on CAD/CAM, robotics &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp; factories of the future Trinidad and Tobago June 26 - 28, 2000). - proceedings. vol. 1. Trinidad, 2000, S. 1 - 8

An approximation algorithm for single server parallel machine problem.
In: Proth, J.-M. (Hrsg.) ; Tanaev, V. (Hrsg.): Discrete optimization methods in scheduling and computer-aided design (International workshop Minsk, September 5-6, 2000). - proceedings. Minsk, 2000, S. 58 - 62

Complexity of scheduling problems with late work criteria
In: Seventh International Workshop on Project Management and Scheduling (PMS 2000) . - [Osnabrück : Univ. of Osnabrück, Department of Mathematics/Computer Science], S. 70-72 ; Kongress: International Workshop on Project Management and Scheduling; 7 (Osnabrück) : 2000.04.17-19

Complexity results for scheduling problems with a single server
In: Seventh International Workshop on Project Management and Scheduling (PMS 2000) . - [Osnabrück : Univ. of Osnabrück, Department of Mathematics/Computer Science], S. 82-84 ; Kongress: International Workshop on Project Management and Scheduling; 7 (Osnabrück) : 2000.04.17-19

Dominance relations on the set of schedules for uncertain job shop.
In: Proth, J.-M. (Hrsg.) ; Tanaev, V. (Hrsg.): Discrete optimization methods in scheduling and computer-aided design (International workshop Minsk, September 5-6, 2000). - proceedings. Minsk, 2000, S. 99 - 101

Mixed shop scheduling problems
In: Seventh International Workshop on Project Management and Scheduling (PMS 2000) . - [Osnabrück : Univ. of Osnabrück, Department of Mathematics/Computer Science], S. 249-251 ; Kongress: International Workshop on Project Management and Scheduling; 7 (Osnabrück) : 2000.04.17-19

Optimal coloring of the vertices from the unions of paths and cliques.
In: Proth, J.-M. (Hrsg.) ; Tanaev, V. (Hrsg.): Discrete optimization methods in scheduling and computer-aided design (International workshop Minsk, September 5-6, 2000). - proceedings. Minsk, 2000, S. 93 - 98

Complexity of mixed shop scheduling problems : a survey.
In: European journal of operational research : EJOR [Amsterdam] 120(2000), S. 343 - 351

O zadace minimizacii vzvesennogo cisla zapazdyvajuscich trebovanij s zestkimi direktivnymi srokami i vlozennymi intervalami obsluzivanija.
In: Doklady Nacionalnoj Akademii Nauk Belarusi [Minsk] 44(2000), Nr. 1, S. 39 - 42

On the solution of 2-machine flow shop problems with a common due date.
In: Inderfurth, Karl (Hrsg.) ; ... (Hrsg.): Operations research, SOR 1999 (Symposium Magdeburg September 1-3, 1999). - proceedings. Berlin : Springer, 2000, S. 383 - 388 (Operations research proceedings 1999)

Scheduling with deadlines and nested processing intervals for a single machine.
In: Inderfurth, Karl (Hrsg.) ; ... (Hrsg.): Operations research, SOR 1999 (Symposium Magdeburg September 1-3, 1999). - proceedings. Berlin : Springer, 2000, S. 378 - 382 (Operations research proceedings 1999)

Total late work criteria for shop scheduling problems.
In: Inderfurth, Karl (Hrsg.) ; ... (Hrsg.): Operations research, SOR 1999 (Symposium Magdeburg September 1-3, 1999). - proceedings. Berlin : Springer, 2000, S. 354 - 359 (Operations research proceedings 1999)