Scheduling algorithms / (Record no. 434)

MARC details
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 090412s2007 gw a b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2006940721
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540695158 (alk. paper)
035 ## - SYSTEM CONTROL NUMBER
System control number (Sirsi) u1390
040 ## - CATALOGING SOURCE
Original cataloging agency EG-CaNU
Transcribing agency EG-CaNU
Modifying agency EG-CaNU
042 ## - AUTHENTICATION CODE
Authentication code ncode
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 22
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Brucker, Peter.
9 (RLIN) 1467
245 10 - TITLE STATEMENT
Title Scheduling algorithms /
Statement of responsibility, etc. Peter Brucker.
250 ## - EDITION STATEMENT
Edition statement 5th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Berlin ;
-- New York :
Name of publisher, distributor, etc. Springer,
Date of publication, distribution, etc. c2007.
300 ## - PHYSICAL DESCRIPTION
Extent xii, 371 p. :
Other physical details ill. ;
Dimensions 25 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Preface -- Classification of Scheduling Problems -- Scheduling Problems -- Job Data -- Job Characteristics -- Machine Environment -- Optimality Criteria -- Examples -- Some Problems in Combinatorial Optimization -- Linearand Integer Programming -- Transshipment Problems -- The Maximum Flow Problem -- Bipartite Matching Problems -- The Assignment Problem -- Arc Coloring of Bipartite Graphs -- Shortest Path Problems and Dynamic Programming -- Computational Complexity -- The Classes <$>{\cal P}<$> and <$>{\cal N}{\cal P}<$> -- <$>{\cal N}{\cal P}<$>-complete and <$>{\cal N}{\cal P}<$>-hard Problems -- Simple Reductions Between Scheduling Problems -- Living with <$>{\cal N}{\cal P}<$>-hard Problems -- Local Search Techniques -- Branch-and-Bound Algorithms -- Single Machine Scheduling Problems -- Minimax Criteria -- Lawler's Algorithm for 1 prec fmax -- 1 -- Maximum Lateness and Related Criteria -- Total Weighted Completion Time -- 1 tree <$>\sum<$>wjCj -- 1 sp-graph <$>\sum<$>wjCj -- Weighted Number of Late Jobs -- 1 rj; pj = 1 <$>\sum<$>wjUj -- 1 pj = 1 <$>\sum<$>wjUj -- 1 <$>\sum<$>Uj -- 1 rj; pmtn <$>\sum<$>wjUj -- Total Weighted Tardiness -- Problems with Release Times and Identical Processing Times -- 1 rj; pj = p <$>\sum<$>wjUj -- 1 rj; pj = p <$>\sum<$>wjCj and 1 rj; pj = p <$>\sum<$>Tj -- Complexity of Single Machine Problems -- Parallel Machines -- Independent Jobs -- Identical Machines -- Uniform Machines -- Unrelated Machines -- Jobs with Precedence Constraints -- P tree; pi = 1 Lmax-Problems -- Problem P2 prec; pi = 1 Lmax -- Complexity Results -- Shop Scheduling Problems -- The Disjunctive Graph Model -- Open Shop Problems -- Arbitrary Processing Times -- Unit Processing Times -- Flow Shop Problems -- Minimizing Makespan -- Job Shop Problems -- Problems with Two Machines -- Problems with Two Jobs.A Geometric Approach -- Job Shop Problemswith Two Machines -- A Branch-and-Bound Algorithm -- Applying Tabu-Search to the Job Shop Problem -- Mixed Shop Problems -- Problemswith Two Machines -- Problemswith Two Jobs -- Complexityof Shop Scheduling Problems -- Due-Date Scheduling -- Problem 1 dopt <$>\sum<$>wi L¿(i) + w0 c d -- Problem 1 -- Problem 1 -- Problem 1 -- Problem 1 -- Problem 1 -- Problem 1 -- Batching Problems -- Single Machine s-Batching Problems -- Single Machine p-Batching Problems -- The Unbounded Model -- The Bounded Model -- Complexity Results for Single Machine Batching Problems -- Changeover Times and Transportation Times -- Single Machine Problems -- Problems with Parallel Machines -- General Shop Problems -- Multi-Purpose Machines -- MPM Problems with Identical and Uniform Machines -- MPM Problems with Shop Characteristics -- Arbitrary Processing Times -- Unit Processing Times -- Complexity Results -- Multiprocessor Tasks -- Multiprocessor Task Systems -- Shop Problems with MPT: Arbitrary Processing Times -- Shop Problems with MPT: Unit Processing Times -- Multi-Mode Multiprocessor-Task Scheduling Problems -- Complexity Results.
520 ## - SUMMARY, ETC.
Summary, etc. 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. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems.
596 ## -
-- 1
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer capacity
General subdivision Planning.
9 (RLIN) 1468
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Production scheduling.
9 (RLIN) 1469
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms.
9 (RLIN) 1470
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Source of acquisition Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Main library Main library General Stacks 01/26/2020 ACA-P   005.1 / BR.S 2007 001708 11/24/2019 1 11/24/2019 Books