{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:37:37Z","timestamp":1648870657442},"reference-count":166,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,3,24]],"date-time":"2011-03-24T00:00:00Z","timestamp":1300924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10951-011-0230-4","type":"journal-article","created":{"date-parts":[[2011,3,23]],"date-time":"2011-03-23T16:22:55Z","timestamp":1300897375000},"page":"403-418","source":"Crossref","is-referenced-by-count":1,"title":["Vyacheslav Tanaev: contributions to scheduling and related areas"],"prefix":"10.1007","volume":"15","author":[{"given":"V. S.","family":"Gordon","sequence":"first","affiliation":[]},{"given":"M. Y.","family":"Kovalyov","sequence":"additional","affiliation":[]},{"given":"G. M.","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Y. M.","family":"Shafransky","sequence":"additional","affiliation":[]},{"given":"Y. N.","family":"Sotskov","sequence":"additional","affiliation":[]},{"given":"V. A.","family":"Strusevich","sequence":"additional","affiliation":[]},{"given":"A. V.","family":"Tuzikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,24]]},"reference":[{"issue":"4","key":"230_CR1","first-page":"224","volume":"7","author":"V. S. Aizenshtat","year":"1963","unstructured":"Aizenshtat, V. S. (1963). Multi-operator cyclic processes. Doklady Akademii Nauk BSSR, 7(4), 224\u2013227 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR2","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/j.amc.2006.04.063","volume":"182","author":"F. Al-Anzi","year":"2006","unstructured":"Al-Anzi, F., Sotskov, Yu. N., Allahverdi, A., & Andreev, G. (2006). Using mixed graph coloring to minimize total completion time in job shop scheduling. Mathematics of Computation, 182, 1137\u20131148.","journal-title":"Mathematics of Computation"},{"key":"230_CR3","first-page":"102","volume":"3","author":"V. B. Alyushkevich","year":"1989","unstructured":"Alyushkevich, V. B., & Sotskov, Yu. N. (1989). Stability in the problems of production planning. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 3, 102\u2013107 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR4","volume-title":"Introduction to sequencing and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"issue":"2","key":"230_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"K. R. Baker","year":"1983","unstructured":"Baker, K. R., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H.\u00a0G. (1983). Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 31(2), 381\u2013386.","journal-title":"Operations Research"},{"key":"230_CR6","first-page":"76","volume":"1","author":"S. A. Barkan","year":"1970","unstructured":"Barkan, S. A., & Tanaev, V. S. (1970). On constructing class schedules. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 1, 76\u201381 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR7","first-page":"57","volume-title":"Modelling and Performance Evaluation of Computer Systems","author":"J. Blazewicz","year":"1976","unstructured":"Blazewicz, J. (1976). Scheduling dependent tasks with different arrival times to meet deadlines. In E. Gelenbe & H. Beilner (Eds.), Modelling and Performance Evaluation of Computer Systems (pp.\u00a057\u201365). Amsterdam: North Holland."},{"key":"230_CR8","volume-title":"Handbook on scheduling","author":"J. Blazewicz","year":"2007","unstructured":"Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook on scheduling. Berlin: Springer."},{"key":"230_CR9","first-page":"5","volume":"2","author":"A. S. Blokh","year":"1966","unstructured":"Blokh, A. S., & Tanaev, V. S. (1966). Multioperator processes. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 2, 5\u201311 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"issue":"1\u20134","key":"230_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/B:ANOR.0000030683.64615.c8","volume":"129","author":"P. Brucker","year":"2004","unstructured":"Brucker, P., Knust, S., Cheng, T. C. E., & Shakhlevich, N. V. (2004). Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research, 129(1\u20134), 81\u2013106.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"230_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"Christofides, N., & Beasley, J. E. (1984). Period routing problem. Networks, 14(2), 237\u2013256.","journal-title":"Networks"},{"issue":"3","key":"230_CR12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"Coffman, E. G., & Graham, R. L. (1972). Optimal scheduling for two-processor systems. Acta Informatica, 1(3), 200\u2013213.","journal-title":"Acta Informatica"},{"key":"230_CR13","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley."},{"issue":"1","key":"230_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101\u2013112.","journal-title":"Operations Research"},{"key":"230_CR15","first-page":"77","volume-title":"Theory of graphs","author":"G. B. Dantzig","year":"1967","unstructured":"Dantzig, G. B., Blattner, W., & Rao, M. R. (1967). Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. In P. Rosenstiehl (Ed.), Theory of graphs (pp.\u00a077\u201384). Paris\/New York: Dunod\/Gordon & Breach."},{"issue":"5","key":"230_CR16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-005-2861-9","volume":"8","author":"M. Dawande","year":"2005","unstructured":"Dawande, M., Geismer, H. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: Recent developments. Journal of Scheduling, 8(5), 387\u2013426.","journal-title":"Journal of Scheduling"},{"key":"230_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"Dilworth, R. P. (1950). A decomposition for partially ordered sets. Annals of Mathematics, 51, 161\u2013166.","journal-title":"Annals of Mathematics"},{"issue":"5","key":"230_CR18","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1080\/09511920500081593","volume":"18","author":"A. Dolgui","year":"2005","unstructured":"Dolgui, A., Levin, G., & Louly, M. A. (2005). Decomposition approach for a problem of lot-sizing and sequencing under uncertainties. International Journal of Computer Integrated Manufacturing, 18(5), 376\u2013385.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"18\u201319","key":"230_CR19","doi-asserted-by":"crossref","first-page":"4105","DOI":"10.1080\/00207540600632232","volume":"44","author":"A. Dolgui","year":"2006","unstructured":"Dolgui, A., Finel, B., Guschinskaya, O., Guschinsky, N., Levin, G., & Vernadat, F. (2006a). Balancing large-scale machining lines with multi-spindle heads using decomposition. International Journal of Production Research, 44(18\u201319), 4105\u20134120.","journal-title":"International Journal of Production Research"},{"key":"230_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10852-005-9014-1","volume":"5","author":"A. Dolgui","year":"2006","unstructured":"Dolgui, A., Guschinsky, N., & Levin, G. (2006b). A decomposition method for transfer line life cycle cost optimization. Journal of Mathematical Modeling and Algorithms, 5, 215\u2013238.","journal-title":"Journal of Mathematical Modeling and Algorithms"},{"key":"230_CR21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1051\/ro:2007017","volume":"41","author":"A. Dolgui","year":"2007","unstructured":"Dolgui, A., Guschinsky, N., & Levin, G. (2007). Optimisation of power transmission systems using a multilevel decomposition approach. RAIRO\u2013Operations Research, 41, 213\u2013229.","journal-title":"RAIRO\u2013Operations Research"},{"key":"230_CR22","doi-asserted-by":"crossref","first-page":"155","DOI":"10.4018\/978-1-59904-843-7.ch018","volume-title":"Encyclopedia of decision making and decision support technologies","author":"A. Dolgui","year":"2008","unstructured":"Dolgui, A., Guschinskaya, O., Guschinsky, N., & Levin, G. (2008a). Decision making and support tools for design of machining systems. In F. Adam & P. Humphreys (Eds.), Encyclopedia of decision making and decision support technologies (pp. 155\u2013164). Hershey: Idea Group Inc."},{"key":"230_CR23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4018\/978-1-59904-843-7.ch019","volume-title":"Encyclopedia of decision making and decision support technologies","author":"A. Dolgui","year":"2008","unstructured":"Dolgui, A., Guschinsky, N., & Levin, G. (2008b). Decision making and support tools for design of transmission systems. In F. Adam & P. Humphreys (Eds.), Encyclopedia of decision making and decision support technologies (pp. 165\u2013175). Hershey: Idea Group Inc."},{"issue":"4","key":"230_CR24","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1080\/0233193021000030760","volume":"51","author":"V. A. Emelichev","year":"2002","unstructured":"Emelichev, V. A., Girlich, E. N., Nikulin, Y. V., & Podkopaev, D. P. (2002). Stability and regularization radius of vector problems of integer linear programming. Optimization, 51(4), 645\u2013676.","journal-title":"Optimization"},{"key":"230_CR25","first-page":"66","volume":"1","author":"Y. G. Ermoliev","year":"1972","unstructured":"Ermoliev, Y. G., & Ermolieva, L. G. (1972). Method of parametric decomposition. Kibernetika, 1, 66\u201369.","journal-title":"Kibernetika"},{"key":"230_CR26","volume-title":"Flows in networks","author":"L. R. Jr. Ford","year":"1962","unstructured":"Ford, L. R. Jr., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"key":"230_CR27","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/B:JOCO.0000021935.66577.09","volume":"8","author":"A. A. Gladky","year":"2004","unstructured":"Gladky, A. A., Shafransky, Y. M., & Strusevich, V. A. (2004). Flow shop scheduling problems under machine-dependent precedence constraints. Journal of Combinatorial Optimization, 8, 13\u201328.","journal-title":"Journal of Combinatorial Optimization"},{"key":"230_CR28","first-page":"101","volume-title":"Proceedings of the 4-th all-union conference on theoretical cybernetics problems","author":"V. S. Gordon","year":"1977","unstructured":"Gordon, V. S., & Shafransky, Y. M. (1977). On a class of scheduling problems with partially ordered jobs. In Proceedings of the 4-th all-union conference on theoretical cybernetics problems, Novosibirsk, August 30\u2013September\u00a01 (pp. 101\u2013103) (in Russian)."},{"issue":"3","key":"230_CR29","first-page":"244","volume":"22","author":"V. S. Gordon","year":"1978","unstructured":"Gordon, V. S., & Shafransky, Y. M. (1978a). Optimal ordering with series-parallel precedence constraints. Doklady Akademii Nauk BSSR, 22(3), 244\u2013247 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR30","first-page":"51","volume-title":"Proceedings of the 5-th all-union conference of complex system control","author":"V. S. Gordon","year":"1978","unstructured":"Gordon, V. S., & Shafransky, Y. M. (1978b). The decomposition approach to minimizing functions over a set of permutations of partially ordered elements. In Proceedings of the 5-th all-union conference of complex system control (pp. 51\u201356). Alma-Ata (in Russian)."},{"key":"230_CR31","first-page":"135","volume":"5","author":"V. S. Gordon","year":"1978","unstructured":"Gordon, V. S., & Shafransky, Y. M. (1978c). On optimal ordering with series-parallel precedence constraints. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 5, 135 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR32","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(98)00055-0","volume":"26","author":"V. S. Gordon","year":"1999","unstructured":"Gordon, V. S., & Strusevich, V. A. (1999). Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26, 157\u2013177.","journal-title":"Computers & Operations Research"},{"key":"230_CR33","first-page":"3","volume-title":"Computers in engineering","author":"V. S. Gordon","year":"1971","unstructured":"Gordon, V. S., & Tanaev, V. S. (1971). Single-machine deterministic scheduling with step functions of penalties. In Computers in engineering (pp. 3\u20138). Minsk (in Russian)."},{"key":"230_CR34","first-page":"3","volume-title":"Computers in engineering","author":"V. S. Gordon","year":"1973","unstructured":"Gordon, V. S., & Tanaev, V. S. (1973a). Single-machine deterministic scheduling with tree-like ordered jobs and exponential penalty functions. In Computers in engineering (pp. 3\u201310). Minsk (in Russian)."},{"key":"230_CR35","series-title":"Institute of Engineering Cybernetics of Academy of Sciences of BSSR\u2014Institute of Engineering Cybernetics of Bulgarian Academy of Sciences","first-page":"36","volume-title":"Optimization of systems of collecting, transfer and processing of analogous and discrete data in local information computing systems. Materials of the 1st joint Soviet-Bulgarian seminar","author":"V. S. Gordon","year":"1973","unstructured":"Gordon, V. S., & Tanaev, V. S. (1973b). Preemptions in deterministic systems with parallel machines and different release dates of jobs. In Optimization of systems of collecting, transfer and processing of analogous and discrete data in local information computing systems. Materials of the 1st joint Soviet-Bulgarian seminar. Institute of Engineering Cybernetics of Academy of Sciences of BSSR\u2014Institute of Engineering Cybernetics of Bulgarian Academy of Sciences (pp. 36\u201350). Minsk (in Russian)."},{"key":"230_CR36","series-title":"Materials of the 1st joint Soviet-Bulgarian seminar, Institute of Engineering Cybernetics of Academy of Sciences of BSSR\u2014Institute of Engineering Cybernetics of Bulgarian Academy of Sciences","first-page":"54","volume-title":"Optimization of systems of collecting, transfer and processing of analogous and discrete data in local information computing systems","author":"V. S. Gordon","year":"1973","unstructured":"Gordon, V. S., & Tanaev, V. S. (1973c). Due dates in single-stage deterministic scheduling. In Optimization of systems of collecting, transfer and processing of analogous and discrete data in local information computing systems. Materials of the 1st joint Soviet-Bulgarian seminar, Institute of Engineering Cybernetics of Academy of Sciences of BSSR\u2014Institute of Engineering Cybernetics of Bulgarian Academy of Sciences (pp. 54\u201358). Minsk (in Russian)."},{"key":"230_CR37","first-page":"3","volume":"3","author":"V. S. Gordon","year":"1983","unstructured":"Gordon, V. S., & Tanaev, V. S. (1983). On minmax problems of scheduling theory for a single machine. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 3, 3\u20139 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR38","first-page":"687","volume-title":"Proceedings of the 2nd IFAC\/IFIP\/IEEE conference, management and control of production and logistics","author":"V. S. Gordon","year":"2001","unstructured":"Gordon, V. S., & Tanaev, V. S. (2001). Scheduling decisions for the systems with deadlines. In Z. Binder (Ed.), Proceedings of the 2nd IFAC\/IFIP\/IEEE conference, management and control of production and logistics (vol.\u00a02, pp. 687\u2013690). Elmsford: Pergamon."},{"key":"230_CR39","first-page":"15","volume":"13","author":"V. S. Gordon","year":"2005","unstructured":"Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2005). Single machine scheduling and due date assignment under series-parallel precedence constraints. Central European Journal of Operations Research, 13, 15\u201335.","journal-title":"Central European Journal of Operations Research"},{"key":"230_CR40","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"V. S. Gordon","year":"2008","unstructured":"Gordon, V. S., Potts, C. N., Strusevich, V. A., & Whitehead, J. D. (2008). Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation. Journal of Scheduling, 11, 357\u2013370.","journal-title":"Journal of Scheduling"},{"key":"230_CR41","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"230_CR42","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1016\/j.ejor.2006.03.072","volume":"189","author":"O. Guschinskaya","year":"2008","unstructured":"Guschinskaya, O., Dolgui, A., Guschinsky, N., & Levin, G. (2008). A\u00a0heuristic multi-start decomposition approach for optimal design of serial machining lines. European Journal of Operational Research, 189(3), 902\u2013913.","journal-title":"European Journal of Operational Research"},{"key":"230_CR43","first-page":"3","volume":"3","author":"N. N. Guschinsky","year":"1987","unstructured":"Guschinsky, N. N., & Levin, G. M. (1987). Two-level optimization of a composite function and its application to a problem of path optimization in a graph. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 3, 3\u20139 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR44","first-page":"167","volume":"17","author":"N. N. Guschinsky","year":"1991","unstructured":"Guschinsky, N. N., & Levin, G. M. (1991). Minimization of a monotone superposition of recurrent-monotone functions over the set of parametrized paths in a digraph. Sistemy Modelirovaniya, 17, 167\u2013178 (in Russian).","journal-title":"Sistemy Modelirovaniya"},{"issue":"6","key":"230_CR45","first-page":"31","volume":"29","author":"N. N. Guschinsky","year":"1991","unstructured":"Guschinsky, N. N., Levin, G. M., & Tanaev, V. S. (1991). Parametric decomposition of problems of minimizing composite functions on parametrized paths in a digraph. Soviet Journal of Computer and Systems Sciences, 29(6), 31\u201342 (translated from Russian, Izvestiya AN SSSR. Seria Tekhnicheskaya Kibernetika, 1990).","journal-title":"Soviet Journal of Computer and Systems Sciences"},{"key":"230_CR46","volume-title":"Decision support for design of power transmissions","author":"N. N. Guschinsky","year":"2006","unstructured":"Guschinsky, N. N., Levin, G. M., & Dolgui, A. B. (2006). Decision support for design of power transmissions. Minsk: Belaruskaya Navuka (in Russian)."},{"key":"230_CR47","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01194253","volume":"45","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Kuplinsky, J., & de Werra, D. (1997). Mixed graph colorings. Mathematical Methods of Operational Research, 45, 145\u2013160.","journal-title":"Mathematical Methods of Operational Research"},{"key":"230_CR48","volume-title":"Inequalities","author":"G. H. Hardy","year":"1934","unstructured":"Hardy, G. H., Littlewood, J. E., & Polya, G. (1934). Inequalities. London: Cambridge University Press."},{"key":"230_CR49","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0123021","volume":"23","author":"W. A. Horn","year":"1972","unstructured":"Horn, W. A. (1972). Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM Journal of Applied Mathematics, 23, 189\u2013202.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"1","key":"230_CR50","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W. A. Horn","year":"1974","unstructured":"Horn, W. A. (1974). Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21(1), 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"230_CR51","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T. C. Hu","year":"1961","unstructured":"Hu, T. C. (1961). Parallel sequencing and assembly line problems. Operations Research, 9, 841\u2013848.","journal-title":"Operations Research"},{"key":"230_CR52","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43, Management Science Research Project). University of California, Los Angeles, USA."},{"key":"230_CR53","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ejor.2004.12.012","volume":"173","author":"A. Janiak","year":"2006","unstructured":"Janiak, A., & Kovalyov, M. Y. (2006). Scheduling in a contaminated area: a model and polynomial algorithms. European Journal of Operational Research, 173, 125\u2013132.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"230_CR54","first-page":"61","volume":"12","author":"A. Janiak","year":"2001","unstructured":"Janiak, A., Shafransky, Y. M., & Tuzikov, A. (2001). Sequencing with ordered criteria, precedence and group technology constraints. Informatica, 12(1), 61\u201388.","journal-title":"Informatica"},{"key":"230_CR55","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"230_CR56","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R. M. Karp","year":"1978","unstructured":"Karp, R. M. (1978). A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23, 309\u2013311.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"230_CR57","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"R. M. Karp","year":"1981","unstructured":"Karp, R. M., & Orlin, J. B. (1981). Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics, 3(1), 37\u201345.","journal-title":"Discrete Applied Mathematics"},{"key":"230_CR58","first-page":"99","volume":"6","author":"G. K. Kladov","year":"1968","unstructured":"Kladov, G. K., & Livshitz, E. M. (1968). On a scheduling problem to minimize the total penalty. Kibernetika, 6, 99\u2013100 (in Russian).","journal-title":"Kibernetika"},{"key":"230_CR59","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"A. W. J. Kolen","year":"2007","unstructured":"Kolen, A. W. J., Lenstra, J. K., Papadimitriou, C. H., & Spieksma, F. C. R. (2007). Interval scheduling: a\u00a0survey. Naval Research Logistics, 54, 530\u2013543.","journal-title":"Naval Research Logistics"},{"key":"230_CR60","doi-asserted-by":"crossref","first-page":"141","DOI":"10.2307\/1911892","volume":"33","author":"J. Kornai","year":"1965","unstructured":"Kornai, J., & Liptak, T. (1965). Two-level planning. Econometrica, 33, 141\u2013169.","journal-title":"Econometrica"},{"key":"230_CR61","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0166-218X(97)00138-8","volume":"84","author":"M. Y. Kovalyov","year":"1998","unstructured":"Kovalyov, M. Y., & Shafransky, Y. M. (1998). Uniform machine scheduling of unit-time jobs subject to resource constraints. Discrete Applied Mathematics, 84, 253\u2013257.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"230_CR62","first-page":"635","volume":"4","author":"M. Y. Kovalyov","year":"1994","unstructured":"Kovalyov, M. Y., & Tuzikov, A. V. (1994). Sequencing groups of jobs on a single machine subject to precedence constraints. Applied Mathematics and Computer Science, 4(4), 635\u2013641.","journal-title":"Applied Mathematics and Computer Science"},{"issue":"6","key":"230_CR63","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1080\/02331938908843507","volume":"20","author":"M. Y. Kovalyov","year":"1989","unstructured":"Kovalyov, M. Y., Shafransky, Y. M., Strusevich, V. A., Tanaev, V. S., & Tuzikov, A. V. (1989). Approximation scheduling algorithms: a survey. Optimization, 20(6), 859\u2013878.","journal-title":"Optimization"},{"key":"230_CR64","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"M. Y. Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: models, applications, computational complexity and algorithms. European Journal of Operational Research, 178, 331\u2013342.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"230_CR65","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1080\/002075498192265","volume":"36","author":"K. Kruger","year":"1998","unstructured":"Kruger, K., Sotskov, Yu. N., & Werner, F. (1998). Heuristic for generalized shop scheduling problems based on decomposition. International Journal of Production Research, 36(11), 3013\u20133033.","journal-title":"International Journal of Production Research"},{"issue":"9","key":"230_CR66","first-page":"780","volume":"14","author":"N. V. Lambin","year":"1970","unstructured":"Lambin, N. V., & Tanaev, V. S. (1970). On circuit-free orientation of mixed graphs. Doklady Akademii Nauk BSSR, 14(9), 780\u2013781 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"issue":"1","key":"230_CR67","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G. Laporte","year":"1995","unstructured":"Laporte, G., & Osman, I. H. (1995). Routing problems: a\u00a0bibliography. Annals of Operation Research, 61(1), 227\u2013262.","journal-title":"Annals of Operation Research"},{"issue":"4","key":"230_CR68","first-page":"1298","volume":"15","author":"V. K. Leont\u2019ev","year":"1975","unstructured":"Leont\u2019ev, V. K. (1975). Stability of the traveling salesman problem. Zhurnal Vychislitel\u2019noj Matematiki i Matematicheskoj Fiziki, 15(4), 1298\u20131309 (in Russian).","journal-title":"Zhurnal Vychislitel\u2019noj Matematiki i Matematicheskoj Fiziki"},{"key":"230_CR69","first-page":"9","volume":"5","author":"G. M. Levin","year":"1980","unstructured":"Levin, G. M. (1980). Towards optimization of functions recursively defined over weakly normalized sets of permutations. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 5, 9\u201314.","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR70","first-page":"30","volume":"5","author":"G. M. Levin","year":"1968","unstructured":"Levin, G. M., & Tanaev, V. S. (1968). On a class of problems of combinatorial optimization. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 5, 30\u201335 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"issue":"7","key":"230_CR71","first-page":"588","volume":"14","author":"G. M. Levin","year":"1970","unstructured":"Levin, G. M., & Tanaev, V. S. (1970). On the theory of optimization over a set of permutations. Doklady Akademii Nauk BSSR, 14(7), 588\u2013590 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR72","first-page":"24","volume":"4","author":"G. M. Levin","year":"1974","unstructured":"Levin, G. M., & Tanaev, V. S. (1974a). Parametric decomposition of extremal problems. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 4, 24\u201329 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"issue":"10","key":"230_CR73","first-page":"883","volume":"18","author":"G. M. Levin","year":"1974","unstructured":"Levin, G. M., & Tanaev, V. S. (1974b). Towards the theory of parametric decomposition of extremal problems. Doklady Akademii Nauk BSSR, 18(10), 883\u2013885 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR74","first-page":"123","volume":"3","author":"G. M. Levin","year":"1977","unstructured":"Levin, G. M., & Tanaev, V. S. (1977). On parametric decomposition of extremal problems. Kibernetika, 3, 123\u2013128 (in Russian).","journal-title":"Kibernetika"},{"key":"230_CR75","volume-title":"Decomposition methods in optimization of design decisions","author":"G. M. Levin","year":"1978","unstructured":"Levin, G. M., & Tanaev, V. S. (1978). Decomposition methods in optimization of design decisions. Minsk: Nauka i Tekhnika (in Russian)."},{"key":"230_CR76","first-page":"121","volume":"4","author":"G. M. Levin","year":"1998","unstructured":"Levin, G. M., & Tanaev, V. S. (1998). Parametric decomposition of optimization problems. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 4, 121\u2013131 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR77","first-page":"4","volume":"2","author":"G. M. Levin","year":"2002","unstructured":"Levin, G. M., & Tanaev, V. S. (2002). Extended parametric decomposition of optimization problems: some properties and applications. Iskusstvenny Intellekt, 2, 4\u201310 (in Russian).","journal-title":"Iskusstvenny Intellekt"},{"key":"230_CR78","first-page":"114","volume":"2","author":"G. M. Levin","year":"2004","unstructured":"Levin, G. M., Guschinsky, N. N., & Burdo, E. I. (2004). Optimization of transmission parameters of a cascade-reproduction structure. Vestsi NAN of Belarus. Seryya Fizika-Matematychnykh Navuk, 2, 114\u2013120.","journal-title":"Vestsi NAN of Belarus. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR79","doi-asserted-by":"crossref","DOI":"10.5772\/52","volume-title":"Multiprocessor scheduling: theory and applications","author":"E. Levner","year":"2007","unstructured":"Levner, E., Kats, V., & De Pablo, D. A. L. (2007). Cyclic scheduling in robotic cells: an extension of basic models in machine scheduling theory. In E. Levner (Ed.), Multiprocessor scheduling: theory and applications Vienna: Itech Education and Publishing."},{"key":"230_CR80","first-page":"35","volume-title":"Computers in engineering","author":"L. P. Matyushkov","year":"1967","unstructured":"Matyushkov, L. P., & Tanaev, V. S. (1967). A program generator for feasible schedules, I. In Computers in engineering (pp. 35\u201348). Minsk (in Russian)."},{"key":"230_CR81","first-page":"12","volume-title":"Computers in engineering","author":"L. P. Matyushkov","year":"1968","unstructured":"Matyushkov, L. P., & Tanaev, V. S. (1968). A program generator for feasible schedules, II. In Computers in engineering (pp. 12\u201328). Minsk (in Russian)."},{"issue":"1","key":"230_CR82","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1\u201312.","journal-title":"Management Science"},{"key":"230_CR83","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800133.804326","volume-title":"Proceedings of the 10th annual ACM symposium on theory of computing","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N. (1978). Combinatorial optimization with rational objective functions. In Proceedings of the 10th annual ACM symposium on theory of computing (pp. 1\u201312). San Diego."},{"key":"230_CR84","first-page":"45","volume":"1","author":"V. S. Mikhalevich","year":"1965","unstructured":"Mikhalevich, V. S. (1965a). Sequential algorithms of optimization and their application: I. Kibernetika, 1, 45\u201366.","journal-title":"Kibernetika"},{"key":"230_CR85","first-page":"85","volume":"2","author":"V. S. Mikhalevich","year":"1965","unstructured":"Mikhalevich, V. S. (1965b). Sequential algorithms of optimization and their application:\u00a0II. Kibernetika, 2, 85\u201389 (in Russian).","journal-title":"Kibernetika"},{"key":"230_CR86","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"C. L. Monma","year":"1979","unstructured":"Monma, C. L., & Sidney, J. B. (1979). Sequencing with series-parallel precedence constraints. Mathematics of Operations Research, 4, 215\u2013234.","journal-title":"Mathematics of Operations Research"},{"issue":"1\u20133","key":"230_CR87","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"J. B. Orlin","year":"1992","unstructured":"Orlin, J. B., & Ahuja, R. K. (1992). New scaling algorithms for the assignment and minimum mean cycle problems. Mathematical Programming, 54(1\u20133), 41\u201356.","journal-title":"Mathematical Programming"},{"key":"230_CR88","doi-asserted-by":"crossref","first-page":"S41","DOI":"10.1057\/jors.2009.2","volume":"60","author":"C. N. Potts","year":"2009","unstructured":"Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: a survey of milestones. The Journal of the Operational Research Society, 60, S41\u2013S68.","journal-title":"The Journal of the Operational Research Society"},{"key":"230_CR89","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2006.05.004","volume":"155","author":"B. Ries","year":"2007","unstructured":"Ries, B. (2007). Coloring some classes of mixed graphs. Discrete Applied Mathematics, 155, 1\u20136.","journal-title":"Discrete Applied Mathematics"},{"key":"230_CR90","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.ejc.2007.03.006","volume":"29","author":"B. Ries","year":"2008","unstructured":"Ries, B., & de Werra, D. (2008). On two coloring problems in mixed graphs. European Journal of Combinatorics, 29, 712\u2013725.","journal-title":"European Journal of Combinatorics"},{"issue":"6","key":"230_CR91","first-page":"1303","volume":"157","author":"I. V. Romanovskii","year":"1964","unstructured":"Romanovskii, I. V. (1964). Asymptotic recursive relations of dynamic programming and optimal stationary control. Doklady Akademii Nauk SSSR, 157(6), 1303\u20131306 (in Russian).","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"230_CR92","first-page":"66","volume":"3","author":"I. V. Romanovskii","year":"1967","unstructured":"Romanovskii, I. V. (1967). Optimization of stationary control of a discrete deterministic process. Kibernetika, 3, 66\u201378 (in Russian).","journal-title":"Kibernetika"},{"key":"230_CR93","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","volume":"12","author":"M. H. Rothkopf","year":"1966","unstructured":"Rothkopf, M. H. (1966). Scheduling independent tasks on parallel processors. Management Science, 12, 437\u2013447.","journal-title":"Management Science"},{"key":"230_CR94","unstructured":"Roy, B., & Sussmann, B. (1964). Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives (Note DS No\u00a09 bis.). SEMA, Montrouge."},{"key":"230_CR95","first-page":"119","volume":"2","author":"Y. M. Shafransky","year":"1978","unstructured":"Shafransky, Y. M. (1978a). Optimization for deterministic scheduling systems with tree-like partial order. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 2, 119 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR96","first-page":"120","volume":"2","author":"Y. M. Shafransky","year":"1978","unstructured":"Shafransky, Y. M. (1978b). On optimal sequencing for deterministic systems with tree-like partial order. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 2, 120 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR97","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F","volume":"45","author":"Y. M. Shafransky","year":"1998","unstructured":"Shafransky, Y. M., & Strusevich, V. A. (1998). The open shop scheduling problem with a given sequence on one machine. Naval Research Logistics, 45, 705\u2013731.","journal-title":"Naval Research Logistics"},{"key":"230_CR98","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10288-005-0061-2","volume":"3","author":"N. V. Shakhlevich","year":"2005","unstructured":"Shakhlevich, N. V. (2005). Open shop unit-time scheduling problems with symmetric objective functions. 4OR, 3, 117\u2013131.","journal-title":"4OR"},{"issue":"1","key":"230_CR99","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1049\/ip-cta:19960089","volume":"43","author":"N. V. Shakhlevich","year":"1996","unstructured":"Shakhlevich, N. V., Sotskov, Yu. N., & Werner, F. (1996). Adaptive scheduling algorithm based on the mixed graph model. IEE Proceedings. Control Theory and Applications, 43(1), 9\u201316.","journal-title":"IEE Proceedings. Control Theory and Applications"},{"key":"230_CR100","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"230_CR101","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0377-2217(91)90194-Z","volume":"55","author":"Yu. N. Sotskov","year":"1991","unstructured":"Sotskov, Yu. N. (1991). Stability of an optimal schedule. European Journal of Operational Research, 55, 91\u2013102.","journal-title":"European Journal of Operational Research"},{"key":"230_CR102","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/02331939708844361","volume":"42","author":"Yu. N. Sotskov","year":"1997","unstructured":"Sotskov, Yu. N. (1997). Mixed multigraph approach to scheduling jobs on machines of different types. Optimization, 42, 245\u2013280.","journal-title":"Optimization"},{"issue":"4","key":"230_CR103","first-page":"108","volume":"32","author":"Yu. N. Sotskov","year":"1988","unstructured":"Sotskov, Yu. N., & Alyushkevich, V. B. (1988). Stability of optimal orientation of the edges of a mixed graph. Doklady Akademii Nauk BSSR, 32(4), 108\u2013111 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR104","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(95)80004-N","volume":"59","author":"Yu. N. Sotskov","year":"1995","unstructured":"Sotskov, Yu. N., & Shakhlevich, N. V. (1995). NP-hardness of shop-scheduling problems with three jobs. Discrete Applied Mathematics, 59, 237\u2013266.","journal-title":"Discrete Applied Mathematics"},{"key":"230_CR105","first-page":"16","volume":"2","author":"Yu. N. Sotskov","year":"1974","unstructured":"Sotskov, Yu. N., & Tanaev, V. S. (1974). On enumeration of the circuit-free digraphs generated by a mixed graph. Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk, 2, 16\u201321 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR106","first-page":"99","volume":"5","author":"Yu. N. Sotskov","year":"1976","unstructured":"Sotskov, Yu. N., & Tanaev, V. S. (1976a). On one approach to enumeration of the circuit-free digraphs generated by a mixed graph. Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk, 5, 99\u2013102 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR107","first-page":"20","volume":"6","author":"Yu. N. Sotskov","year":"1976","unstructured":"Sotskov, Yu. N., & Tanaev, V. S. (1976b). A chromatic polynomial of a mixed graph. Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk, 6, 20\u201323 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR108","first-page":"94","volume":"4","author":"Yu. N. Sotskov","year":"1989","unstructured":"Sotskov, Yu. N., & Tanaev, V. S. (1989). Construction of a schedule admissible for a mixed multi-graph. Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk, 4, 94\u201398 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR109","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1049\/ise.1994.0001","volume":"1","author":"Yu. N. Sotskov","year":"1994","unstructured":"Sotskov, Yu. N., & Tanaev, V. S. (1994). Scheduling theory and practice: Minsk group results. Intelligent Systems Engineering, 1, 1\u20138.","journal-title":"Intelligent Systems Engineering"},{"key":"230_CR110","volume-title":"Mathematical models and methods of production planning","author":"Yu. N. Sotskov","year":"1994","unstructured":"Sotskov, Yu. N., Strusevich, V. A., & Tanaev, V. S. (1994). Mathematical models and methods of production planning. Minsk: Universitetskoe (in Russian)."},{"key":"230_CR111","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","volume":"58","author":"Yu. N. Sotskov","year":"1995","unstructured":"Sotskov, Yu. N., Leontev, V. K., & Gordeev, E. N. (1995). Some concepts of stability analysis in combinatorial optimization. Discrete Applied Mathematics, 58, 169\u2013190.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"230_CR112","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0305-0483(97)00012-1","volume":"25","author":"Yu. N. Sotskov","year":"1997","unstructured":"Sotskov, Yu. N., Sotskova, N. Yu., & Werner, F. (1997). Stability of an optimal schedule in a job shop. Omega, 25(4), 397\u2013414.","journal-title":"Omega"},{"key":"230_CR113","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-1-4757-2876-7_4","volume-title":"Industrial applications of combinatorial optimization","author":"Yu. N. Sotskov","year":"1998","unstructured":"Sotskov, Yu. N., Tanaev, V. S., & Werner, F. (1998a). Stability radius of an optimal schedule: a\u00a0survey and recent development. In Industrial applications of combinatorial optimization (pp. 72\u2013108). Boston: Kluwer Academic."},{"key":"230_CR114","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1018960030420","volume":"83","author":"Yu. N. Sotskov","year":"1998","unstructured":"Sotskov, Yu. N., Wagelmans, A. P. M., & Werner, F. (1998b). On the calculation of the stability radius of an optimal or an approximate schedule. Annals of Operation Research, 83, 213\u2013252.","journal-title":"Annals of Operation Research"},{"key":"230_CR115","first-page":"289","volume":"2","author":"Yu. N. Sotskov","year":"2001","unstructured":"Sotskov, Yu. N., Dolgui, A., & Werner, F. (2001). Mixed graph coloring for unit-time job-shop scheduling. International Journal of Mathematical Algorithms, 2, 289\u2013323.","journal-title":"International Journal of Mathematical Algorithms"},{"issue":"3","key":"230_CR116","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/0233193021000004994","volume":"51","author":"Yu. N. Sotskov","year":"2002","unstructured":"Sotskov, Yu. N., Tanaev, V. S., & Werner, F. (2002). Scheduling problems and mixed graph colorings. Optimization, 51(3), 597\u2013624.","journal-title":"Optimization"},{"key":"230_CR117","first-page":"217","volume-title":"Applications of combinatorial mathematics","author":"V. A. Strusevich","year":"1997","unstructured":"Strusevich, V. A. (1997a). Multi-stage scheduling problems with precedence constraints. In C. Mitchell (Ed.), Applications of combinatorial mathematics (pp. 217\u2013232). London: Oxford University Press."},{"key":"230_CR118","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1018997431986","volume":"69","author":"V. A. Strusevich","year":"1997","unstructured":"Strusevich, V. A. (1997b). Shop scheduling problems under precedence constraints. Annals of Operation Research, 69, 351\u2013377.","journal-title":"Annals of Operation Research"},{"issue":"9","key":"230_CR119","first-page":"541","volume":"6","author":"D. A. Suprunenko","year":"1962","unstructured":"Suprunenko, D. A., Aizenshtat, V. S., & Metel\u2019sky, A. S. (1962). A\u00a0multistage technological process. Doklady Akademii Nauk BSSR, 6(9), 541\u2013544 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR120","first-page":"111","volume":"3","author":"V. S. Tanaev","year":"1964","unstructured":"Tanaev, V. S. (1964a). On a flow shop scheduling problem with one operator. Inzhenerno-Fizicheskij Zhurnal, 3, 111\u2013114 (in Russian).","journal-title":"Inzhenerno-Fizicheskij Zhurnal"},{"key":"230_CR121","first-page":"128","volume":"4","author":"V. S. Tanaev","year":"1964","unstructured":"Tanaev, V. S. (1964b). On a scheduling problem. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 4, 128\u2013131 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"issue":"12","key":"230_CR122","first-page":"792","volume":"8","author":"V. S. Tanaev","year":"1964","unstructured":"Tanaev, V. S. (1964c). On scheduling theory. Doklady Akademii Nauk BSSR, 8(12), 792\u2013794 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"issue":"1","key":"230_CR123","first-page":"11","volume":"9","author":"V. S. Tanaev","year":"1965","unstructured":"Tanaev, V. S. (1965). Some objective functions of a single stage production. Doklady Akademii Nauk BSSR, 9(1), 11\u201314 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"issue":"3","key":"230_CR124","first-page":"208","volume":"9","author":"V. S. Tanaev","year":"1967","unstructured":"Tanaev, V. S. (1967). On the number of permutations of n partially ordered elements. Doklady Akademii Nauk BSSR, 9(3), 208 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"issue":"5","key":"230_CR125","first-page":"776","volume":"4","author":"V. S. Tanaev","year":"1968","unstructured":"Tanaev, V. S. (1968). A method to solve a discrete programming problem. Ekonomika i Matematicheskie Metody, 4(5), 776\u2013782 (in Russian).","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"230_CR126","first-page":"44","volume":"6","author":"V. S. Tanaev","year":"1973","unstructured":"Tanaev, V. S. (1973). Preemptions in deterministic scheduling systems with parallel identical machines. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 6, 44\u201348 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR127","first-page":"181","volume-title":"Large systems of information and control","author":"V. S. Tanaev","year":"1975","unstructured":"Tanaev, V. S. (1975). Mixed (disjunctive) graphs in scheduling problems. In Large systems of information and control (p. 181). Sofia (in Russian)."},{"key":"230_CR128","first-page":"27","volume":"3","author":"V. S. Tanaev","year":"1977","unstructured":"Tanaev, V. S. (1977a). On optimization of recursive functions on a set of permutations. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 3, 27\u201330 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR129","first-page":"1997","volume-title":"Program library for solving extremal problems. Issue 1","year":"1977","unstructured":"Tanaev, V. S. (Ed.) (1977b). Program library for solving extremal problems. Issue 1 (p. 1997). Minsk: Institute of Engineering Cybernetics (in Russian)."},{"issue":"1","key":"230_CR130","first-page":"26","volume":"23","author":"V. S. Tanaev","year":"1979","unstructured":"Tanaev, V. S. (1979a). On optimal partitioning a finite set into subsets. Doklady Akademii Nauk BSSR, 23(1), 26\u201328 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"key":"230_CR131","volume-title":"Program library for solving extremal problems. Issue 2","year":"1979","unstructured":"Tanaev, V. S. (Ed.) (1979b). Program library for solving extremal problems. Issue 2. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR132","volume-title":"Algorithms and programs for solving optimization problems","year":"1980","unstructured":"Tanaev, V. S. (Ed.) (1980). Algorithms and programs for solving optimization problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR133","volume-title":"Methods and programs for solving extremal problems","year":"1981","unstructured":"Tanaev, V. S. (Ed.) (1981). Methods and programs for solving extremal problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR134","volume-title":"Methods and programs for solving extremal problems and related issues","year":"1982","unstructured":"Tanaev, V. S. (Ed.) (1982). Methods and programs for solving extremal problems and related issues. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR135","volume-title":"Algorithms and programs for solving optimization problems","year":"1983","unstructured":"Tanaev, V. S. (Ed.) (1983). Algorithms and programs for solving optimization problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR136","volume-title":"Complexity and methods for solving optimization problems","year":"1984","unstructured":"Tanaev, V. S. (Ed.) (1984). Complexity and methods for solving optimization problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR137","volume-title":"Methods, algorithms and programs for solving extremal problems","year":"1985","unstructured":"Tanaev, V. S. (Ed.) (1985). Methods, algorithms and programs for solving extremal problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR138","volume-title":"Decomposition and aggregation in mathematical programming problems","author":"V. S. Tanaev","year":"1987","unstructured":"Tanaev, V. S. (1987). Decomposition and aggregation in mathematical programming problems. Minsk: Nauka i Technika (in Russian)."},{"key":"230_CR139","volume-title":"Scheduling theory","author":"V. S. Tanaev","year":"1988","unstructured":"Tanaev, V. S. (1988). Scheduling theory. Moscow: Znanie (in Russian)."},{"key":"230_CR140","volume-title":"Methods for solving extremal problems","year":"1989","unstructured":"Tanaev, V. S. (Ed.) (1989). Methods for solving extremal problems. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR141","volume-title":"Methods for solving extremal problems and related issues","year":"1990","unstructured":"Tanaev, V. S. (Ed.) (1990). Methods for solving extremal problems and related issues. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR142","volume-title":"Extremal problems of optimal planning and design","year":"1991","unstructured":"Tanaev, V. S. (Ed.) (1991). Extremal problems of optimal planning and design. Minsk: Institute of Engineering Cybernetics (in Russian)."},{"key":"230_CR143","first-page":"97","volume":"5\u20136","author":"V. S. Tanaev","year":"1992","unstructured":"Tanaev, V. S. (1992). Symmetric functions in scheduling theory (single machine problems with the same job release dates). Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 5\u20136, 97\u2013101 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR144","first-page":"84","volume":"1","author":"V. S. Tanaev","year":"1993","unstructured":"Tanaev, V. S. (1993). Symmetric functions in scheduling theory (single machine problems with distinct job release dates). Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 1, 84\u201387 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR145","first-page":"81","volume":"4","author":"V. S. Tanaev","year":"1994","unstructured":"Tanaev, V. S., & Gladky, A. A. (1994a). Symmetric functions in scheduling theory (identical machines problems with ordered set of jobs). Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 4, 81\u201384 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR146","unstructured":"Tanaev, V. S., & Gladky, A. A. (1994b). Symmetric functions in scheduling theory (parallel machines systems) (Preprint 23). Minsk: Institute of Engineering Cybernetics."},{"key":"230_CR147","first-page":"3","volume":"6","author":"V. S. Tanaev","year":"1983","unstructured":"Tanaev, V. S., & Gordon, V. S. (1983). On scheduling to minimize the weighted number of late jobs. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 6, 3\u20139 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR148","first-page":"82","volume":"3","author":"V. S. Tanaev","year":"1967","unstructured":"Tanaev, V. S., & Levin, G. M. (1967). On optimal behavior of limited memory systems. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 3, 82\u201388 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR149","volume-title":"Synthesis of graph-schemes of decision-making","author":"V. S. Tanaev","year":"1974","unstructured":"Tanaev, V. S., & Povarich, M. P. (1974). Synthesis of graph-schemes of decision-making. Minsk: Nauka i Technika."},{"key":"230_CR150","volume-title":"Introduction to scheduling theory","author":"V. S. Tanaev","year":"1975","unstructured":"Tanaev, V. S., & Shkurba, V. V. (1975). Introduction to scheduling theory. Moscow: Nauka (in Russian)."},{"key":"230_CR151","volume-title":"Scheduling theory. Single-stage systems","author":"V. S. Tanaev","year":"1984","unstructured":"Tanaev, V. S., Gordon, V. S., & Shafransky, Y. M. (1984a). Scheduling theory. Single-stage systems. Moscow: Nauka (in Russian); translated into English by Kluwer Academic Publishers, Dordrecht (1994)."},{"key":"230_CR152","volume-title":"Program package for multi-step optimization (PP MODA)","author":"V. S. Tanaev","year":"1984","unstructured":"Tanaev, V. S., Levin, G. M., & Sannikova, A. K. (1984b). Program package for multi-step optimization (PP MODA). Minsk: Institute of Engineering Cybernetics."},{"key":"230_CR153","volume-title":"A\u00a0package of applied programs for solving sequencing problems (PAP RUPOR)","author":"V. S. Tanaev","year":"1986","unstructured":"Tanaev, V. S., Gordon, V. S., Sotskov, Yu. N., Yanova, O. V., Shafransky, Y. M., Gorokh, O. V., & Baranovskaya, S. M. (1986a). A\u00a0package of applied programs for solving sequencing problems (PAP RUPOR). Minsk: Institute of Engineering (in Russian)."},{"key":"230_CR154","volume-title":"A dialog system for synthesis of programs of multi-step optimization (MODA-7920)","author":"V. S. Tanaev","year":"1986","unstructured":"Tanaev, V. S., Levin, G. M., Rozin, B. M., & Sannikova, A. K. (1986b). A dialog system for synthesis of programs of multi-step optimization (MODA-7920). Minsk: Institute of Engineering (in Russian)."},{"key":"230_CR155","first-page":"95","volume":"3","author":"V. S. Tanaev","year":"1986","unstructured":"Tanaev, V. S., Levin, G. M., Rozin, B. M., & Sannikova, A. K. (1986c). A dialog system for design of programs of multi-step optimization MODA-7906. Upravlyayushchie Sistemy i Machiny, 3, 95\u201399.","journal-title":"Upravlyayushchie Sistemy i Machiny"},{"key":"230_CR156","volume-title":"A\u00a0package of applied programs for solving sequencing problems (PAP RUPOR). Programs description","author":"V. S. Tanaev","year":"1987","unstructured":"Tanaev, V. S., Gordon, V. S., Sotskov, Yu. N., Yanova, O. V., Shafransky, Y. M., Gorokh, O. V., & Baranovskaya, S. M. (1987). A\u00a0package of applied programs for solving sequencing problems (PAP RUPOR). Programs description. Minsk: Institute of Engineering (in Russian)."},{"key":"230_CR157","first-page":"107","volume":"4","author":"V. S. Tanaev","year":"1989","unstructured":"Tanaev, V. S., Gordon, V. S., Sotskov, Yu. N., & Yanova, O.\u00a0V. (1989a). A program package for solving scheduling theory problems. Upravlyayuschie Sistemy i Machiny, 4, 107\u2013111 (in Russian).","journal-title":"Upravlyayuschie Sistemy i Machiny"},{"key":"230_CR158","volume-title":"Scheduling theory. Multi-stage systems","author":"V. S. Tanaev","year":"1989","unstructured":"Tanaev, V. S., Sotskov, Yu. N., & Strusevich, V. A. (1989b). Scheduling theory. Multi-stage systems. Moscow: Nauka (in Russian); translated into English by Kluwer Academic Publishers, Dordrecht (1994)."},{"key":"230_CR159","volume-title":"Scheduling theory. Group technologies","author":"V. S. Tanaev","year":"1998","unstructured":"Tanaev, V. S., Kovalyov, M. Y., & Shafransky, Y. M. (1998). Scheduling theory. Group technologies. Minsk: Institute of Engineering (in Russian)."},{"key":"230_CR160","first-page":"115","volume":"6","author":"A. V. Tuzikov","year":"1983","unstructured":"Tuzikov, A. V., & Shafransky, Y. M. (1983). On problems of lexicographic minimization on a set of permutations. Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk, 6, 115 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR, Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR161","first-page":"13","volume":"1","author":"L. F. Verina","year":"1985","unstructured":"Verina, L. F. (1985). Solution of some non-convex problems by reduction to convex mathematical programming. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 1, 13\u201318 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"key":"230_CR162","first-page":"28","volume":"2","author":"L. F. Verina","year":"1991","unstructured":"Verina, L. F., & Levin, G. M. (1991). On a problem of optimization of a transfer function of network elements and its application to transmission design. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk, 2, 28\u201332 (in Russian).","journal-title":"Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk"},{"issue":"4","key":"230_CR163","first-page":"137","volume":"26","author":"L. F. Verina","year":"1988","unstructured":"Verina, L. F., Levin, G. M., & Tanaev, V. S. (1988). Parametric decomposition of extremal problems\u2014a\u00a0general approach and some applications. Soviet Journal of Computer and Systems Sciences, 26(4), 137\u2013148 (translated from Russian, Izvestiya AN SSSR. Seria Tekhnicheskaya Kibernetika).","journal-title":"Soviet Journal of Computer and Systems Sciences"},{"issue":"4","key":"230_CR164","first-page":"9","volume":"39","author":"L. F. Verina","year":"1995","unstructured":"Verina, L. F., Levin, G. M., & Tanaev, V. S. (1995). Towards the theory of parametric decomposition and immersion of extremum problems. Doklady Akademii Nauk BSSR, 39(4), 9\u201312 (in Russian).","journal-title":"Doklady Akademii Nauk BSSR"},{"issue":"2","key":"230_CR165","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"N. E. Young","year":"1991","unstructured":"Young, N. E., Tarjan, R. E., & Orlin, J. B. (1991). Faster parametric shortest path and minimum-balance algorithms. Networks, 21(2), 205\u2013221.","journal-title":"Networks"},{"key":"230_CR166","first-page":"56","volume-title":"Problems of design of automated systems of production control","author":"Y. A. Zinder","year":"1976","unstructured":"Zinder, Y. A. (1976). The priority solvability of a class of scheduling problems. In Problems of design of automated systems of production control (pp. 56\u201363). Kiev (in Russian)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0230-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0230-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0230-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0230-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,24]]},"references-count":166,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0230-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,24]]}}}