
Deterministic Scheduling Theory
R. Gary Parker(Author)
Chapman & Hall/CRC (Publisher)
1st Edition
Published on 1. February 1996
Book
Hardback
296 pages
978-0-412-99681-8 (ISBN)
Description
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.
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.
More details
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Dimensions
Height: 280 mm
Width: 210 mm
Weight
635 gr
ISBN-13
978-0-412-99681-8 (9780412996818)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Parker\, R. Gary
Content
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
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