Titlebook: Scheduling in Computer and Manufacturing Systems; Jacek Blazewicz,Klaus Ecker,Jan Wȩglarz Book 19931st edition Springer-Verlag Berlin Heid

McKinley

书目名称Scheduling in Computer and Manufacturing Systems影响因子(影响力)




书目名称Scheduling in Computer and Manufacturing Systems影响因子(影响力)学科排名




书目名称Scheduling in Computer and Manufacturing Systems网络公开度




书目名称Scheduling in Computer and Manufacturing Systems网络公开度学科排名




书目名称Scheduling in Computer and Manufacturing Systems被引频次




书目名称Scheduling in Computer and Manufacturing Systems被引频次学科排名




书目名称Scheduling in Computer and Manufacturing Systems年度引用




书目名称Scheduling in Computer and Manufacturing Systems年度引用学科排名




书目名称Scheduling in Computer and Manufacturing Systems读者反馈




书目名称Scheduling in Computer and Manufacturing Systems读者反馈学科排名

祖传

Needlework

debris

Occipital-Lobe

Formulation of Scheduling Problems,sk is to be processed by at most one processor at a time (plus possibly specified amounts of additional resources) and each processor is capable of processing at most one task at a time. In Sections 5.4 and 7.2 we will show some new applications in which the first constraint will be relaxed.

dialect

Static Shop Scheduling,ime algorithms, where special cases of flow shop and open shop scheduling problems will be considered. Then the job shop scheduling problem will be discussed and two approaches, a heuristic based on simulated annealing and an exact based on branch and bound will be presented.

hardheaded

结构

Introduction,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 v

系列

Preliminaries,ms, optimization problems and the encoding of problem instances are discussed. The way algorithms will be represented, and problem membership of complexity classes are other issues that are essential because algorithms for scheduling problems and their properties will be discussed from the complexit

榨取

Formulation of Scheduling Problems,..} and set . of . types of . = {.., ..,...,..}. Scheduling, generally speaking, means to assign processors from . and (possibly) resources from . , to tasks from . in order to complete all tasks under the imposed constraints. There are two general constraints in classical scheduling theory. Each ta