Scheduling in Computer and Manufacturing Systems by Jacek Blazewicz, Klaus H. Ecker, Günter Schmidt, Jan Weglarz.

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 m...

Full description

Saved in:
Bibliographic Details
Main Authors: Blazewicz, Jacek (Author), Ecker, Klaus H. (Author), Schmidt, Günter (Author), Weglarz, Jan (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1994.
Edition:2nd ed. 1994.
Series:Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3226649
003 MWH
005 20191023202131.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 |a 9783642790348 
024 7 |a 10.1007/978-3-642-79034-8  |2 doi 
035 |a (DE-He213)978-3-642-79034-8 
050 4 |a E-Book 
072 7 |a KJT  |2 bicssc 
072 7 |a BUS049000  |2 bisacsh 
072 7 |a KJT  |2 thema 
072 7 |a KJMD  |2 thema 
100 1 |a Blazewicz, Jacek.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Scheduling in Computer and Manufacturing Systems  |h [electronic resource] /  |c by Jacek Blazewicz, Klaus H. Ecker, Günter Schmidt, Jan Weglarz. 
250 |a 2nd ed. 1994. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1994. 
300 |a X, 312 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer eBook Collection 
505 0 |a 1 Introduction -- References -- 2 Preliminaries -- 2.1 Sets and Relations -- 2.2 Problems, Algorithms, Complexity -- 2.3 Graphs and Networks -- 2.4 Enumerative Methods -- 2.5 Heuristic and Approximation Algorithms -- References -- 3 Formulation of Scheduling Problems -- 3.1 Definition of Scheduling Problems -- 3.2 Analysis of Scheduling Problems and Algorithms -- 3.3 Motivations for Deterministic Scheduling Problems -- 3.4 Classification of Deterministic Scheduling Problems -- References -- 4 Single Processor Scheduling -- 4.1 Minimizing Schedule Length -- 4.2 Minimizing Mean Weighted Flow Time -- 4.3 Minimizing Due Date Involving Criteria -- 4.4 Minimizing Change-Over Cost -- 4.5 Other Criteria -- References -- 5 Parallel Processor Scheduling -- 5.1 Minimizing Schedule Length -- 5.2 Minimizing Mean Row Time -- 5.3 Minimizing Due Date Involving Criteria -- 5.4 Other Models -- References -- 6 Static Shop Scheduling -- 6.1 Flow Shop Scheduling -- 6.2 Open Shop Scheduling -- 6.3 Job Shop Scheduling -- References -- 7 Resource Constrained Scheduling -- 7.1 Classical Model -- 7.2 Scheduling Multiprocessor Tasks -- 7.3 Scheduling with Continuous Resources -- References -- 8 Scheduling in Flexible Manufacturing Systems -- 8.1 Introductory Remarks -- 8.2 Scheduling Flexible Flow Shops -- 8.3 Scheduling Dynamic Job Shops -- 8.4 Simultaneous Scheduling and Routing in some FMS -- References -- 9 From Theory to Practice -- 9.1 Scheduling in Computer Integrated Manufacturing -- 9.2 Solution Approaches Based on Artificial Intelligence -- 9.3 Integration of Knowledge and Algorithms -- References. 
520 |a 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Operations research. 
650 0 |a Decision making. 
650 0 |a Production management. 
650 0 |a Information technology. 
650 0 |a Business—Data processing. 
650 0 |a Organization. 
650 0 |a Planning. 
650 0 |a Manufactures. 
650 0 |a Economic theory. 
690 |a Electronic resources (E-books) 
700 1 |a Ecker, Klaus H.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Schmidt, Günter.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Weglarz, Jan.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-642-79034-8  |3 Click to view e-book 
907 |a .b32266492  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SBE 
912 |a ZDB-2-BAE 
950 |a Business and Economics (Springer-11643) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21398148  |z 02-26-20 
999 f f |i 3735b895-1eb3-5ae5-ba69-f5e62b4ed3f1  |s 51fcc6d5-cb64-52ce-9692-8c07f5d9793f 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |e E-Book  |h Library of Congress classification  |i Elec File  |n 1