Advertisement

Scheduling in Computer and Manufacturing Systems

  • Jacek Błazewicz
  • Klaus H. Ecker
  • Günter Schmidt
  • Jan Węglarz

Table of contents

  1. Front Matter
    Pages I-IX
  2. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 1-5
  3. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 6-36
  4. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 37-50
  5. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 51-111
  6. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 112-170
  7. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 171-191
  8. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 192-234
  9. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 235-263
  10. Jacek Błazewicz, Klaus H. Ecker, Günter Schmidt, Jan Węglarz
    Pages 264-297
  11. Back Matter
    Pages 298-313

About this book

Introduction

Let us start with the description of the purpose of this book. First we should explain how we understand its tide. In general, scheduling problems can be understood very broadly as the problems of the allocation of resources over time to perform a set of tasks. By resources we understand arbitrary means tasks compete for. They can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. Also tasks can have a variety of interpretations starting from machining parts in manu­ facturing systems up to processing information in computer systems. The same is true for task characteristics, e. g. ready times, due dates, relative urgency weights, functions describing task processing in relation to allotted resources. Moreover, a structure of a set of tasks, reflecting precedence constraints among them, can be defined in different ways. In addition, different criteria which measure the quality of the performance of a set of tasks can be taken into account.

Keywords

Artificial Intelligence Deterministic Scheduling Problems Deterministisches Task Scheduling Flexible Manufacturing Systems Multiprocessor Systems Multiprozess0r Systeme Operations Research Optimale Reihenfolge Reihenfolge Resource Constrained Sch algorithms complexity scheduling

Authors and affiliations

  • Jacek Błazewicz
    • 1
  • Klaus H. Ecker
    • 2
  • Günter Schmidt
    • 3
  • Jan Węglarz
    • 1
  1. 1.Instytut InformatykiPolitechnika PoznanskaPoznańPoland
  2. 2.Institut für InformatikTechnische Universität ClausthalClausthal-ZellerfeldGermany
  3. 3.Lehrstuhl für Betriebswirtschaftslehre, insbesondere Wirtschaftsinformatik IIUniversität des SaarlandesSaarbrückenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-79034-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-79036-2
  • Online ISBN 978-3-642-79034-8
  • Buy this book on publisher's site