Scheduling algorithms

書誌事項

Scheduling algorithms

Peter Brucker

Springer Verlag, c1998

2nd rev. and enl. ed

  • : hc

大学図書館所蔵 件 / 27

この図書・雑誌をさがす

注記

Includes bibliographical references (p. [321]-337) and index

内容説明・目次

内容説明

Besides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multipurpose machines. The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized.

目次

  • Classification of scheduling problems
  • some problems in combinatorial optimization
  • computational complexity
  • single machine scheduling problems
  • parallel machines
  • shop scheduling problems
  • due date scheduling
  • batching problems
  • changeover times and transportation times
  • multi-purpose machines
  • multiprocessor tasks.

「Nielsen BookData」 より

詳細情報

ページトップへ