Deterministic scheduling theory
著者
書誌事項
Deterministic scheduling theory
Chapman & Hall, 1995
- : hard
大学図書館所蔵 件 / 全22件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [259]-283) and index
内容説明・目次
内容説明
The principal theme of this book is combinatorial scheduling. All coverage is confined to deterministic results and includes conventional models involving single and multiple processors as well as ones of the classic flow and job shop-like variety. In addition, the book discusses workforce staffing models, timetabling problems, the classroom assignment model, and even problems related to traversals in graphs. The author has included understandable descriptions of computational algorithms, demonstrations of algorithms and theorems with sample problems, and substantial lists of end-of-chapter exercises which span from relatively routine manipulation to increasingly challenging, possibly even open problems.
An entire chapter is included on background material. Covered are basic concepts in computational complexity, the theory of graphs, and partial enumeration.
The book should appeal to students and researchers in a host of areas including industrial engineering, operations research, computer science, and discrete mathematics.
目次
List of Figures
List of Tables
Preface
Introduction
Mathematical Preliminaries
Single-Processor Problems
Parallel-Processor Problems
Flow Shops, Job Shops, and Open Shops
Nonstandard Scheduling Problems
Project Scheduling
Chinese Postmen and Traveling Salesmen
References
Index
「Nielsen BookData」 より