000			04512nam a22004335i 4500
710	2		_aSpringerLink (Online service) _9106996
999			_c110703 _d110703
001			110703
003			ES-MaUEC
005			20230102113434.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			180924s2019 gw a o |||| 0|eng d
020			_a9783319989778
024	7		_a10.1007/978-3-319-98977-8 _2doi
040			_bspa _dES-MaUEC _cES-MaUEC
050		4	_aQA402.5 _b2019 EB
100	1		_aZhurovsʹkyĭ, M. Z. _q(Mykhaĭlo Zakharovych) _eautor _9673837
245	1	0	_aCombinatorial Optimization Problems in Planning and Decision Making : _bTheory and Applications _cby Michael Z. Zgurovsky, Alexander A. Pavlov
264		1	_aCham _bSpringer _c2019
300			_a1 recurso en línea (XIV, 518 páginas) _b59 ilustraciones
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF
490	0		_aEngineering (Springer-11647)
490	0		_aStudies in Systems Decision and Control _x2198-4182 _v173
505	0		_aPart I Intractable combinatorial optimization problems. PSC-algorithms -- Optimal scheduling for two criteria for a single machine with arbitrary due dates -- Optimal tasks execution for two criteria with a common due date on parallel machines -- Optimal scheduling for the vector criterion for parallel machines with arbitrary due dates -- The total weighted tardiness of tasks minimization on a single machine -- The total earliness/tardiness minimization on a single machine with arbitrary due dates -- The total tardiness of tasks minimization on identical parallel machines with a common due date -- Minimization of the maximum earliness/tardiness of tasks on identical parallel machines with a common due date -- The total weighted completion time of tasks minimization with precedence relations on a single machine -- Part II: Hierarchical planning and decision making in network systems with limited resources -- The four-level model of planning and decision making -- Algorithmic support of the four-level model of planning and decision making -- Models and methods of decision making with non-formalized goals -- Project 1. Informational Decision Support System for the project management in software development -- Project 2. Universal hierarchical system of scheduling and operational planning for the small-scale type of productions.
520	3		_aThe book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.
650		7	_2embne _aOptimización combinatoria _9157651
650		7	_2embne _aResolución de problemas _9141166
700	1		_aPavlov, Alexander A. _eautor _9670576
776	0	8	_iPrinted edition: _z9783030075521
776	0	8	_iPrinted edition: _z9783319989761
776	0	8	_iPrinted edition: _z9783319989785
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-319-98977-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
988			_aPrimersemestre_2019_Engineering
998			_aSI _cm _dz _feng _ggw _h0 _b09/2019 _eu _zSI