Description 
1 online resource 
Series 
Studies in systems, decision and control ; volume 173 

Studies in systems, decision and control ; v. 173

Contents 
Part I Intractable combinatorial optimization problems. PSCalgorithms  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 fourlevel model of planning and decision making  Algorithmic support of the fourlevel model of planning and decision making  Models and methods of decision making with nonformalized 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 smallscale type of productions 
Summary 
The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computeraided production management systems. It also offers a quick introduction into the theory of PSCalgorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSCalgorithm 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 PSCalgorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSCalgorithm); also, for NPhard 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 
Notes 
Online resource; title from PDF file page (EBSCO, viewed October 1, 2018) 
Subject 
Combinatorial optimization


Problem solving


Combinatorial optimization.


Computeraided design (CAD)


MATHEMATICS  Essays.


MATHEMATICS  PreCalculus.


MATHEMATICS  Reference.


Maths for engineers.


Operational research.


Problem solving.


Production engineering.

Form 
Electronic book

Author 
Pavlov, Alexander A., author

ISBN 
3030075524 

3319989774 

3319989782 

9783030075521 

9783319989778 

9783319989785 
