|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Title:||Editorial: New branches, old roots|
Gordon, Valery S
Kovalyov, Mikhail Y
Shafransky, Yakov M
Strusevich, Vitaly A
|Citation:||Blazewicz J, Burke E, Gordon VS, Kovalyov MY, Shafransky YM & Strusevich VA (2012) Editorial: New branches, old roots, Journal of Scheduling, 15 (4), pp. 399-401.|
|Abstract:||First paragraph: This special issue of the Journal of Scheduling is dedicated to the memory of Vyacheslav S. Tanaev (1940-2002), the initiator and the leader of scheduling research in the Soviet Union and the countries of Eastern Europe. His main fields of interest and contribution include the minimization of functions on permutations of partially ordered elements, conditions for the existence of non-preemptive optimal schedules, mixed graph and multigraph scheduling models, models with recursive functions, symmetric function minimization, scheduling with transfer operators, the parametric decomposition of optimization problems, and many more.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|New branches, old roots.pdf||202.95 kB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.