๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications

โœ Scribed by Michael Z. Zgurovsky, Alexander A. Pavlov


Publisher
Springer International Publishing
Year
2019
Tongue
English
Leaves
527
Series
Studies in Systems, Decision and Control 173
Edition
1st ed.
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The 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.

โœฆ Table of Contents


Front Matter ....Pages i-xiv
Introduction (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 1-14
Front Matter ....Pages 15-15
Optimal Scheduling for Two Criteria for a Single Machine with Arbitrary Due Dates of Tasks (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 17-38
Optimal Scheduling for Vector or Scalar Criterion on Parallel Machines with Arbitrary Due Dates of Tasks (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 39-105
The Total Weighted Tardiness of Tasks Minimization on a Single Machine (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 107-217
The Total Earliness/Tardiness Minimization on a Single Machine with Arbitrary Due Dates (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 219-263
The Total Tardiness of Tasks Minimization on Identical Parallel Machines with Arbitrary Fixed Times of Their Start and a Common Due Date (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 265-290
The Total Weighted Completion Time of Tasks Minimization with Precedence Relations on a Single Machine (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 291-344
Front Matter ....Pages 345-345
The Four-Level Model of Planning and Decision Making (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 347-406
Algorithms and Software of the Four-Level Model of Planning and Decision Making (Michael Z. Zgurovsky, Alexander A. Pavlov)....Pages 407-518

โœฆ Subjects


Engineering; Mathematical and Computational Engineering; Computer-Aided Engineering (CAD, CAE) and Design; Industrial and Production Engineering; Operations Research/Decision Theory


๐Ÿ“œ SIMILAR VOLUMES


Combinatorial Optimization: Theory and A
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A
โœ Bernhard Korte ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Fuzzy Optimization, Decision-making and
โœ Chiranjibe Jana (editor), Madhumangal Pal (editor), Ghulam Muhiuddin (editor), P ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Springer ๐ŸŒ English

<p><span>After developing fuzzy set theory, many contributors focused their research on the extension of fuzzy sets and their computational methodologies, strengthening modern science and technology. In some real-life phenomena, the conventional methods and traditional fuzzy sets cannot be explained