A Book of Open Shop Scheduling: Algorithms, Complexity and Applications, Kubiak Wieslaw
Автор: Mutingi Michael, Mbohwa Charles Название: Grouping Genetic Algorithms: Advances and Applications ISBN: 3319830481 ISBN-13(EAN): 9783319830483 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment.
Автор: Berry Stuart, Lowndes Val, Trovati Marcello Название: Guide to Computational Modelling for Decision Processes: Theory, Algorithms, Techniques and Applications ISBN: 3319856545 ISBN-13(EAN): 9783319856544 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Поставка под заказ. Описание: This interdisciplinary reference and guide provides an introduction to modeling methodologies and models which form the starting point for deriving efficient and effective solution techniques, and presents a series of case studies that demonstrate how heuristic and analytical approaches may be used to solve large and complex problems.
Автор: Drew John H., Evans Diane L., Glen Andrew G. Название: Computational Probability: Algorithms and Applications in the Mathematical Sciences ISBN: 3319827901 ISBN-13(EAN): 9783319827902 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This new edition includes the latest advances and developments in computational probability involving A Probability Programming Language (APPL).
Автор: Wai-Ki Ching; Michael K. Ng Название: Markov Chains: Models, Algorithms and Applications ISBN: 1441939865 ISBN-13(EAN): 9781441939869 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
MARKOV CHAINS: Models, Algorithms and Applications outlines recent developments of Markov chain models for modeling queueing sequences, Internet, re-manufacturing systems, reverse logistics, inventory systems, bio-informatics, DNA sequences, genetic networks, data mining, and many other practical systems.
The book consists of eight chapters. Chapter 1 is a brief introduction to the classical theory on both discrete and continuous time Markov chains. The relationship between Markov chains of finite states and matrix theory is also discussed. Chapter 2 discusses the applications of continuous time Markov chains to model queueing systems and discrete time Markov chains for computing. Chapter 3 studies re-manufacturing systems and presents Markovian models for reverse manufacturing applications. In Chapter 4, Hidden Markov models are applied to classify customers. Chapter 5 discusses the Markov decision process for customer lifetime values. Customer Lifetime Values (CLV) is an important concept and quantity in marketing management. Chapter 6 covers higher-order Markov chain models. Multivariate Markov models are discussed in Chapter 7. It presents a class of multivariate Markov chain models with a lower order of model parameters. Chapter 8 studies higher-order hidden Markov models. It proposes a class of higher-order hidden Markov models with an efficient algorithm for solving the model parameters.
This book is aimed at students, professionals, practitioners, and researchers in applied mathematics, scientific computing, and operational research, who are interested in the formulation and computation of queueing and manufacturing systems.
Автор: Lewis R. M. R. Название: Guide to Graph Colouring: Algorithms and Applications ISBN: 3030810534 ISBN-13(EAN): 9783030810535 Издательство: Springer Рейтинг: Цена: 51230.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms.
Автор: Graham Kendall; Edmund K. Burke; Sanja Petrovic; M Название: Multidisciplinary Scheduling: Theory and Applications ISBN: 1441937811 ISBN-13(EAN): 9781441937810 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The MISTA volume focuses on the following leading edge topics: Fundamentals of Scheduling, Multi-Criteria Scheduling, Personnel Scheduling, Scheduling in Space, Scheduling the Internet, Machine Scheduling, Bin Packing, Educational Timetabling, Sports Scheduling, and Transport Scheduling.
Автор: D. Braha; O. Maimon Название: A Mathematical Theory of Design: Foundations, Algorithms and Applications ISBN: 1441947981 ISBN-13(EAN): 9781441947987 Издательство: Springer Рейтинг: Цена: 261210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Formal Design Theory (PDT) is a mathematical theory of design. FDT explores issues such as: algebraic representation of design artifacts, idealized design process cycle, and computational analysis and measurement of design process complexity and quality.
Автор: J?rg Biethahn; Volker Nissen Название: Evolutionary Algorithms in Management Applications ISBN: 3642647499 ISBN-13(EAN): 9783642647499 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Evolutionary Algorithms (EA) are powerful search and optimisation techniques inspired by the mechanisms of natural evolution.
Автор: T`kindt Vincent, Billaut Jean-Charles, Scott H. Название: Multicriteria Scheduling / Theory, Models and Algorithms ISBN: 3540282300 ISBN-13(EAN): 9783540282303 Издательство: Springer Рейтинг: Цена: 139750.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Scheduling and multicriteria optimisation theory have been subject, separately, to numerous studies. Since the last twenty years, multicriteria scheduling problems have been subject to a growing interest. However, a gap between multicriteria scheduling approaches and multicriteria optimisation field exits. This book is an attempt to collect the elementary of multicriteria optimisation theory and the basic models and algorithms of multicriteria scheduling. It is composed of numerous illustrations, algorithms and examples which may help the reader in understanding the presented concepts. This book covers general concepts such as Pareto optimality, complexity theory, and general method for multicriteria optimisation, as well as dedicated scheduling problems and algorithms: just-in-time scheduling, flexibility and robustness, single machine problems, parallel machine problems, shop problems, etc. The second edition contains revisions and new material.
Автор: Tapan P. Bagchi Название: Multiobjective Scheduling by Genetic Algorithms ISBN: 1461373875 ISBN-13(EAN): 9781461373872 Издательство: Springer Рейтинг: Цена: 186330.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Multiobjective Scheduling by Genetic Algorithms describes methods for developing multiobjective solutions to common production scheduling equations modeling in the literature as flowshops, job shops and open shops.
Автор: Gawiejnowicz Stanislaw Название: Models and Algorithms of Time-Dependent Scheduling ISBN: 3662593610 ISBN-13(EAN): 9783662593615 Издательство: Springer Рейтинг: Цена: 139750.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality of a schedule is measured by a criterion function. The aim of scheduling is to ?nd, among all feasible schedules, a schedule that optimizes the criterion function. A solution to an arbitrary scheduling problem consists in giving a polynomial-time algorithm generating either an optimal schedule or a schedule that is close to the optimal one, if the given scheduling problem has been proved to be computationally intractable. The scheduling problems are subject of interest of the scheduling theory, originated in mid-?fties of the twentieth century. The theory has been developing dynamically and new research areas constantly come into existence. The subject of this book, ti- dependent scheduling, is one of such areas. In time-dependent scheduling, the processing time of a job is variable and depends on the starting time of the job. This crucial assumption allows us to apply the scheduling theory to a broader spectrum of problems. For example, in the framework of the time-dependent scheduling theory we may consider the problems of repayment of multiple loans, ?re ?ghting and maintenance assignments. In this book, we will discuss algorithms and complexity issues concerning various time-dependent scheduling problems.
Автор: Peter Brucker Название: Scheduling Algorithms ISBN: 3642089070 ISBN-13(EAN): 9783642089077 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
