Verfügbarkeit: Scheduling :: THWS Bibkatalog

Scheduling: theory, algorithms, and systems

Efficient scheduling of resources is critical to the proper functioning of businesses in today's competitive environment. Scheduling focuses on theoretical as well as applied aspects of the scheduling of resources. It is unique in the range of problems and issues that it covers. A software pack...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Pinedo, Michael (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	New York Springer 2008
Ausgabe:	3. ed.
Schlagworte:	Ordonnancement (Gestion) Production scheduling Produktionsplanung Reihenfolgeproblem Scheduling Mathematik Betriebsplanung Operations Research Systemtheorie Lehrbuch
Online-Zugang:	Kapitel 2 Vorwort 1 Inhaltsverzeichnis Inhaltsverzeichnis Klappentext
Zusammenfassung:	Efficient scheduling of resources is critical to the proper functioning of businesses in today's competitive environment. Scheduling focuses on theoretical as well as applied aspects of the scheduling of resources. It is unique in the range of problems and issues that it covers. A software package especially designed for the readers of this text is available with this book. Known as LEKIN, this system covers most of the machine environments discussed in this book and enables the user to test many of the algorithms and heuristics described. The book consists of three parts. The first part focuses on deterministic models and deals with single and parallel machine models. The second part covers stochastic models. The third part deals with scheduling in practice. It covers heuristics that are popular with practicioners and also delves into system design and developmental issues. Discussion of the basic properties of scheduling models Computational as well as theoretical exercises at the end of each chapter Thorough examination of numerous applications Investigation of the latest developments in the field Discussion of future research developments CD containing software included with book.
Beschreibung:	Literaturverz. S. 623 - 657
Beschreibung:	XVI, 671 S. Ill., graph. Darst. CD-ROM (12 cm)
ISBN:	9780387789347

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV035075003
003	DE-604
005	20091110
007	t
008	080929s2008 ad\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9780387789347 \|9 978-0-387-78934-7
035			\|a (OCoLC)254330458
035			\|a (DE-599)BSZ285055240
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-703 \|a DE-M347 \|a DE-945 \|a DE-739 \|a DE-91G \|a DE-384 \|a DE-862
050		0	\|a TS157.5
082	0		\|a 658.53 \|2 22
084			\|a QH 465 \|0 (DE-625)141600: \|2 rvk
084			\|a SK 970 \|0 (DE-625)143276: \|2 rvk
084			\|a WIR 775f \|2 stub
084			\|a MAT 608f \|2 stub
084			\|a WIR 527f \|2 stub
100	1		\|a Pinedo, Michael \|e Verfasser \|4 aut
245	1	0	\|a Scheduling \|b theory, algorithms, and systems \|c Michael L. Pinedo
250			\|a 3. ed.
264		1	\|a New York \|b Springer \|c 2008
300			\|a XVI, 671 S. \|b Ill., graph. Darst. \|e CD-ROM (12 cm)
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Literaturverz. S. 623 - 657
520	3		\|a Efficient scheduling of resources is critical to the proper functioning of businesses in today's competitive environment. Scheduling focuses on theoretical as well as applied aspects of the scheduling of resources. It is unique in the range of problems and issues that it covers. A software package especially designed for the readers of this text is available with this book. Known as LEKIN, this system covers most of the machine environments discussed in this book and enables the user to test many of the algorithms and heuristics described. The book consists of three parts. The first part focuses on deterministic models and deals with single and parallel machine models. The second part covers stochastic models. The third part deals with scheduling in practice. It covers heuristics that are popular with practicioners and also delves into system design and developmental issues. Discussion of the basic properties of scheduling models Computational as well as theoretical exercises at the end of each chapter Thorough examination of numerous applications Investigation of the latest developments in the field Discussion of future research developments CD containing software included with book.
650		4	\|a Ordonnancement (Gestion)
650		4	\|a Production scheduling
650	0	7	\|a Produktionsplanung \|0 (DE-588)4047360-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Reihenfolgeproblem \|0 (DE-588)4242167-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Scheduling \|0 (DE-588)4179449-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mathematik \|0 (DE-588)4037944-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Betriebsplanung \|0 (DE-588)4006197-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Operations Research \|0 (DE-588)4043586-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Systemtheorie \|0 (DE-588)4058812-9 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4123623-3 \|a Lehrbuch \|2 gnd-content
689	0	0	\|a Produktionsplanung \|0 (DE-588)4047360-0 \|D s
689	0	1	\|a Reihenfolgeproblem \|0 (DE-588)4242167-6 \|D s
689	0	2	\|a Mathematik \|0 (DE-588)4037944-9 \|D s
689	0	3	\|a Systemtheorie \|0 (DE-588)4058812-9 \|D s
689	0	4	\|a Operations Research \|0 (DE-588)4043586-6 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Scheduling \|0 (DE-588)4179449-7 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Betriebsplanung \|0 (DE-588)4006197-8 \|D s
689	2		\|8 3\p \|5 DE-604
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-0-387-78935-4
856	4		\|q text/html \|u http://swbplus.bsz-bw.de/bsz285055240kap.htm \|3 Kapitel 2
856	4		\|q text/html \|u http://swbplus.bsz-bw.de/bsz285055240vor.htm \|3 Vorwort 1
856	4		\|q text/html \|u http://swbplus.bsz-bw.de/bsz285055240inh.htm \|3 Inhaltsverzeichnis
856	4	2	\|m Digitalisierung UB Passau \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
856	4	2	\|m Digitalisierung UB Passau \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA \|3 Klappentext
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Datensatz im Suchindex

DE-BY-862_location	2000
DE-BY-FWS_call_number	2000/QH 465 P649(3)
DE-BY-FWS_katkey	734443
DE-BY-FWS_media_number	083000508910
_version_	1824555365989089280
adam_text	Contents Preface . vii CD-ROM Contents. xvii 1 Introduction . 1 1.1 The Role of Scheduling . 1 1.2 The Scheduling Function in an Enterprise . 4 1.3 Outline of the Book . 6 Part I Deterministic Models 2 Deterministic Models: Preliminaries . 13 2.1 Framework and Notation . 13 2.2 Examples . 20 2.3 Classes of Schedules . 21 2.4 Complexity Hierarchy . 26 3 Single Machine Models (Deterministic) . 35 3.1 The Total Weighted Completion Time . 36 3.2 The Maximum Lateness . 42 3.3 The Number of Tardy Jobs . 47 3.4 The Total Tardiness - Dynamic Programming . 50 3.5 The Total Tardiness - An Approximation Scheme . 54 3.6 The Total Weighted Tardiness . 57 3.7 Discussion . 61 4 Advanced Single Machine Models (Deterministic) . 69 4.1 The Total Earliness and Tardiness . 70 4.2 Primary and Secondary Objectives . 78 4.3 Multiple Objectives: A Parametric Analysis . 80 4.4 The Makespan with Sequence Dependent Setup Times . 84 4.5 Job Families with Setup Times . 92 4.6 Batch Processing . 99 4.7 Discussion . 106 Parallel Machine Models (Deterministic) . Ill 5.1 The Makespan without Preemptions . 112 5.2 The Makespan with Preemptions . 122 5.3 The Total Completion Time without Preemptions . 130 5.4 The Total Completion Time with Preemptions . 134 5.5 Due Date Related Objectives . 136 5.6 Online Scheduling . 138 5.7 Discussion . 142 Flow Shops and Flexible Flow Shops (Deterministic) . 151 6.1 Flow Shops with Unlimited Intermediate Storage . 152 6.2 Flow Shops with Limited Intermediate Storage . 163 6.3 Flexible Flow Shops with Unlimited Intermediate Storage . 171 6.4 Discussion . 172 Job Shops (Deterministic) . 179 7.1 Disjunctive Programming and Branch-and-Bound . 179 7.2 The Shifting Bottleneck Heuristic and the Makespan. 189 7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness . 197 7.4 Constraint Programming and the Makespan. 203 7.5 Discussion . 211 Open Shops (Deterministic) . 217 8.1 The Makespan without Preemptions . 217 8.2 The Makespan with Preemptions . 221 8.3 The Maximum Lateness without Preemptions . 224 8.4 The Maximum Lateness with Preemptions . 229 8.5 The Number of Tardy Jobs . 233 8.6 Discussion . 234 Part II Stochastic Models 9 Stochastic Models: Preliminaries .243 9.1 Framework and Notation .243 9.2 Distributions and Classes of Distributions .244 9.3 Stochastic Dominance .248 9.4 Impact of Randomness on Fixed Schedules .251 9.5 Classes of Policies .255 10 Single Machine Models (Stochastic) . 263 10.1 Arbitrary Distributions without Preemptions . 263 10.2 Arbitrary Distributions with Preemptions: the Gittins Index . . . 270 10.3 Likelihood Ratio Ordered Distributions . 275 10.4 Exponential Distributions . 278 10.5 Discussion . 285 11 Single Machine Models with Release Dates (Stochastic) . 291 11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions . 292 11.2 Priority Queues, Work Conservation and Poisson Releases . 294 11.3 Arbitrary Releases and Exponential Processing Times with Preemptions . 298 11.4 Poisson Releases and Arbitrary Processing Times without Preemptions . 304 11.5 Discussion . 310 12 Parallel Machine Models (Stochastic) . 317 12.1 The Makespan without Preemptions . 317 12.2 The Makespan and Total Completion Time with Preemptions . 327 12.3 Due Date Related Objectives . 335 12.4 Bounds Obtained through Online Scheduling . 336 12.5 Discussion . 339 13 Flow Shops, Job Shops and Open Shops (Stochastic) . 345 13.1 Stochastic Flow Shops with Unlimited Intermediate Storage . . . 346 13.2 Stochastic Flow Shops with Blocking . 352 13.3 Stochastic Job Shops . 357 13.4 Stochastic Open Shops . 358 13.5 Discussion . 364 Part III Scheduling in Practice 14 General Purpose Procedures for Deterministic Scheduling . . 371 14.1 Dispatching Rules .372 14.2 Composite Dispatching Rules .373 14.3 Local Search: Simulated Annealing and Tabu-Search .378 14.4 Local Search: Genetic Algorithms .385 14.5 Ant Colony Optimization .387 14.6 Discussion .389 15 More Advanced General Purpose Procedures .395 15.1 Beam Search .396 15.2 Decomposition Methods and Rolling Horizon Procedures .398 15.3 Constraint Programming .403 15.4 Market-Based and Agent-Based Procedures .407 15.5 Procedures for Scheduling Problems with Multiple Objectives . . 414 15.6 Discussion .420 16 Modeling and Solving Scheduling Problems in Practice . 427 16.1 Scheduling Problems in Practice . 428 16.2 Cyclic Scheduling of a Flow Line . 431 16.3 Scheduling of a Flexible Flow Line with Limited Buffers and Bypass . 436 16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and Setups . 441 16.5 Scheduling a Bank of Parallel Machines with Jobs having Release Dates and Due Dates . 448 16.6 Discussion . 450 17 Design and Implementation of Scheduling Systems: Basic Concepts .455 17.1 Systems Architecture . 456 17.2 Databases, Object Bases, and Knowledge-Bases . 458 17.3 Modules for Generating Schedules . 463 17.4 User Interfaces and Interactive Optimization . 466 17.5 Generic Systems vs. Application-Specific Systems . 472 17.6 Implementation and Maintenance Issues . 475 18 Design and Implementation of Scheduling Systems: More Advanced Concepts .481 18.1 Robustness and Reactive Decision Making .482 18.2 Machine Learning Mechanisms .487 18.3 Design of Scheduling Engines and Algorithm Libraries .492 18.4 Reconfigurable Systems .496 18.5 Web-Based Scheduling Systems .498 18.6 Discussion .501 19 Examples of System Designs and Implementations . 507 19.1 SAP's Production Planning and Detailed Scheduling System . . . 508 19.2 IBM's Independent Agents Architecture . 511 19.3 i2's Production Scheduler . 515 19.4 Taylor Scheduling Software . 523 19.5 Real Time Dispatching and Agent Scheduling at AMD . 528 19.6 An Implementation of Cybertec's Cyberplan . 533 19.7 LEKIN - A System Developed in Academia . 537 19.8 Discussion .544 20 What Lies Ahead? .547 20.1 Theoretical Research .547 20.2 Applied Research .550 20.3 Systems Development .553 Appendices A Mathematical Programming: Formulations and Applications 559 A.I Linear Programming Formulations . 559 A. 2 Integer Programming Formulations . 563 A.3 Bounds, Approximations and Heuristics Based on Linear Programming . 567 A. 4 Disjunctive Programming Formulations . 569 В Deterministic and Stochastic Dynamic Programming . 573 B.I Deterministic Dynamic Programming . 573 B.2 Stochastic Dynamic Programming . 577 С Constraint Programming . 581 C.I Constraint Satisfaction . 581 C.2 Constraint Programming . 583 C.3 An Example of a Constraint Programming Language . 585 C.4 Constraint Programming vs. Mathematical Programming . 586 D Complexity Theory . 589 D.I Preliminaries . 589 D.2 Polynomial Time Solutions versus NP-Hardness . 592 D.3 Examples . 595 D.4 Approximation Algorithms and Schemes . 598 E Complexity Classification of Deterministic Scheduling Problems . 603 F Overview of Stochastic Scheduling Problems . 607 G Selected Scheduling Systems . 611 H The Lekin System . 615 H.I Formatting of Input and Output Files . 615 H.2 Linking Scheduling Programs . 617 References . 623 Subject Index .659 Name Index .665 This book on scheduling covers both theoretical models as well as scheduling problems in the real world. Author Michael L. Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementa¬ tions of scheduling systems. The book consists of three parts.The first part focuses on deterministic sched¬ uling with the associated combinational problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance.The third part deals with scheduling in practice. It covers heuristics that are popular with practi¬ tioners and discusses system design and developmental issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate stu¬ dents in operations management, operations research, industrial engineer¬ ing, and computer science will find the book to be an accessible and invalu¬ able resource.Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environ¬ ments.
adam_txt	Contents Preface . vii CD-ROM Contents. xvii 1 Introduction . 1 1.1 The Role of Scheduling . 1 1.2 The Scheduling Function in an Enterprise . 4 1.3 Outline of the Book . 6 Part I Deterministic Models 2 Deterministic Models: Preliminaries . 13 2.1 Framework and Notation . 13 2.2 Examples . 20 2.3 Classes of Schedules . 21 2.4 Complexity Hierarchy . 26 3 Single Machine Models (Deterministic) . 35 3.1 The Total Weighted Completion Time . 36 3.2 The Maximum Lateness . 42 3.3 The Number of Tardy Jobs . 47 3.4 The Total Tardiness - Dynamic Programming . 50 3.5 The Total Tardiness - An Approximation Scheme . 54 3.6 The Total Weighted Tardiness . 57 3.7 Discussion . 61 4 Advanced Single Machine Models (Deterministic) . 69 4.1 The Total Earliness and Tardiness . 70 4.2 Primary and Secondary Objectives . 78 4.3 Multiple Objectives: A Parametric Analysis . 80 4.4 The Makespan with Sequence Dependent Setup Times . 84 4.5 Job Families with Setup Times . 92 4.6 Batch Processing . 99 4.7 Discussion . 106 Parallel Machine Models (Deterministic) . Ill 5.1 The Makespan without Preemptions . 112 5.2 The Makespan with Preemptions . 122 5.3 The Total Completion Time without Preemptions . 130 5.4 The Total Completion Time with Preemptions . 134 5.5 Due Date Related Objectives . 136 5.6 Online Scheduling . 138 5.7 Discussion . 142 Flow Shops and Flexible Flow Shops (Deterministic) . 151 6.1 Flow Shops with Unlimited Intermediate Storage . 152 6.2 Flow Shops with Limited Intermediate Storage . 163 6.3 Flexible Flow Shops with Unlimited Intermediate Storage . 171 6.4 Discussion . 172 Job Shops (Deterministic) . 179 7.1 Disjunctive Programming and Branch-and-Bound . 179 7.2 The Shifting Bottleneck Heuristic and the Makespan. 189 7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness . 197 7.4 Constraint Programming and the Makespan. 203 7.5 Discussion . 211 Open Shops (Deterministic) . 217 8.1 The Makespan without Preemptions . 217 8.2 The Makespan with Preemptions . 221 8.3 The Maximum Lateness without Preemptions . 224 8.4 The Maximum Lateness with Preemptions . 229 8.5 The Number of Tardy Jobs . 233 8.6 Discussion . 234 Part II Stochastic Models 9 Stochastic Models: Preliminaries .243 9.1 Framework and Notation .243 9.2 Distributions and Classes of Distributions .244 9.3 Stochastic Dominance .248 9.4 Impact of Randomness on Fixed Schedules .251 9.5 Classes of Policies .255 10 Single Machine Models (Stochastic) . 263 10.1 Arbitrary Distributions without Preemptions . 263 10.2 Arbitrary Distributions with Preemptions: the Gittins Index . . . 270 10.3 Likelihood Ratio Ordered Distributions . 275 10.4 Exponential Distributions . 278 10.5 Discussion . 285 11 Single Machine Models with Release Dates (Stochastic) . 291 11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions . 292 11.2 Priority Queues, Work Conservation and Poisson Releases . 294 11.3 Arbitrary Releases and Exponential Processing Times with Preemptions . 298 11.4 Poisson Releases and Arbitrary Processing Times without Preemptions . 304 11.5 Discussion . 310 12 Parallel Machine Models (Stochastic) . 317 12.1 The Makespan without Preemptions . 317 12.2 The Makespan and Total Completion Time with Preemptions . 327 12.3 Due Date Related Objectives . 335 12.4 Bounds Obtained through Online Scheduling . 336 12.5 Discussion . 339 13 Flow Shops, Job Shops and Open Shops (Stochastic) . 345 13.1 Stochastic Flow Shops with Unlimited Intermediate Storage . . . 346 13.2 Stochastic Flow Shops with Blocking . 352 13.3 Stochastic Job Shops . 357 13.4 Stochastic Open Shops . 358 13.5 Discussion . 364 Part III Scheduling in Practice 14 General Purpose Procedures for Deterministic Scheduling . . 371 14.1 Dispatching Rules .372 14.2 Composite Dispatching Rules .373 14.3 Local Search: Simulated Annealing and Tabu-Search .378 14.4 Local Search: Genetic Algorithms .385 14.5 Ant Colony Optimization .387 14.6 Discussion .389 15 More Advanced General Purpose Procedures .395 15.1 Beam Search .396 15.2 Decomposition Methods and Rolling Horizon Procedures .398 15.3 Constraint Programming .403 15.4 Market-Based and Agent-Based Procedures .407 15.5 Procedures for Scheduling Problems with Multiple Objectives . . 414 15.6 Discussion .420 16 Modeling and Solving Scheduling Problems in Practice . 427 16.1 Scheduling Problems in Practice . 428 16.2 Cyclic Scheduling of a Flow Line . 431 16.3 Scheduling of a Flexible Flow Line with Limited Buffers and Bypass . 436 16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and Setups . 441 16.5 Scheduling a Bank of Parallel Machines with Jobs having Release Dates and Due Dates . 448 16.6 Discussion . 450 17 Design and Implementation of Scheduling Systems: Basic Concepts .455 17.1 Systems Architecture . 456 17.2 Databases, Object Bases, and Knowledge-Bases . 458 17.3 Modules for Generating Schedules . 463 17.4 User Interfaces and Interactive Optimization . 466 17.5 Generic Systems vs. Application-Specific Systems . 472 17.6 Implementation and Maintenance Issues . 475 18 Design and Implementation of Scheduling Systems: More Advanced Concepts .481 18.1 Robustness and Reactive Decision Making .482 18.2 Machine Learning Mechanisms .487 18.3 Design of Scheduling Engines and Algorithm Libraries .492 18.4 Reconfigurable Systems .496 18.5 Web-Based Scheduling Systems .498 18.6 Discussion .501 19 Examples of System Designs and Implementations . 507 19.1 SAP's Production Planning and Detailed Scheduling System . . . 508 19.2 IBM's Independent Agents Architecture . 511 19.3 i2's Production Scheduler . 515 19.4 Taylor Scheduling Software . 523 19.5 Real Time Dispatching and Agent Scheduling at AMD . 528 19.6 An Implementation of Cybertec's Cyberplan . 533 19.7 LEKIN - A System Developed in Academia . 537 19.8 Discussion .544 20 What Lies Ahead? .547 20.1 Theoretical Research .547 20.2 Applied Research .550 20.3 Systems Development .553 Appendices A Mathematical Programming: Formulations and Applications 559 A.I Linear Programming Formulations . 559 A. 2 Integer Programming Formulations . 563 A.3 Bounds, Approximations and Heuristics Based on Linear Programming . 567 A. 4 Disjunctive Programming Formulations . 569 В Deterministic and Stochastic Dynamic Programming . 573 B.I Deterministic Dynamic Programming . 573 B.2 Stochastic Dynamic Programming . 577 С Constraint Programming . 581 C.I Constraint Satisfaction . 581 C.2 Constraint Programming . 583 C.3 An Example of a Constraint Programming Language . 585 C.4 Constraint Programming vs. Mathematical Programming . 586 D Complexity Theory . 589 D.I Preliminaries . 589 D.2 Polynomial Time Solutions versus NP-Hardness . 592 D.3 Examples . 595 D.4 Approximation Algorithms and Schemes . 598 E Complexity Classification of Deterministic Scheduling Problems . 603 F Overview of Stochastic Scheduling Problems . 607 G Selected Scheduling Systems . 611 H The Lekin System . 615 H.I Formatting of Input and Output Files . 615 H.2 Linking Scheduling Programs . 617 References . 623 Subject Index .659 Name Index .665 This book on scheduling covers both theoretical models as well as scheduling problems in the real world. Author Michael L. Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementa¬ tions of scheduling systems. The book consists of three parts.The first part focuses on deterministic sched¬ uling with the associated combinational problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance.The third part deals with scheduling in practice. It covers heuristics that are popular with practi¬ tioners and discusses system design and developmental issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate stu¬ dents in operations management, operations research, industrial engineer¬ ing, and computer science will find the book to be an accessible and invalu¬ able resource.Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environ¬ ments.
any_adam_object	1
any_adam_object_boolean	1
author	Pinedo, Michael
author_facet	Pinedo, Michael
author_role	aut
author_sort	Pinedo, Michael
author_variant	m p mp
building	Verbundindex
bvnumber	BV035075003
callnumber-first	T - Technology
callnumber-label	TS157
callnumber-raw	TS157.5
callnumber-search	TS157.5
callnumber-sort	TS 3157.5
callnumber-subject	TS - Manufactures
classification_rvk	QH 465 SK 970
classification_tum	WIR 775f MAT 608f WIR 527f
ctrlnum	(OCoLC)254330458 (DE-599)BSZ285055240
dewey-full	658.53
dewey-hundreds	600 - Technology (Applied sciences)
dewey-ones	658 - General management
dewey-raw	658.53
dewey-search	658.53
dewey-sort	3658.53
dewey-tens	650 - Management and auxiliary services
discipline	Mathematik Arbeitswissenschaften Wirtschaftswissenschaften
discipline_str_mv	Mathematik Arbeitswissenschaften Wirtschaftswissenschaften
edition	3. ed.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV035075003</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091110</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080929s2008 ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387789347</subfield><subfield code="9">978-0-387-78934-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254330458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ285055240</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-862</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TS157.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.53</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 465</subfield><subfield code="0">(DE-625)141600:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WIR 775f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 608f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WIR 527f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pinedo, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling</subfield><subfield code="b">theory, algorithms, and systems</subfield><subfield code="c">Michael L. Pinedo</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 671 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield><subfield code="e">CD-ROM (12 cm)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 623 - 657</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Efficient scheduling of resources is critical to the proper functioning of businesses in today's competitive environment. Scheduling focuses on theoretical as well as applied aspects of the scheduling of resources. It is unique in the range of problems and issues that it covers. A software package especially designed for the readers of this text is available with this book. Known as LEKIN, this system covers most of the machine environments discussed in this book and enables the user to test many of the algorithms and heuristics described. The book consists of three parts. The first part focuses on deterministic models and deals with single and parallel machine models. The second part covers stochastic models. The third part deals with scheduling in practice. It covers heuristics that are popular with practicioners and also delves into system design and developmental issues. Discussion of the basic properties of scheduling models Computational as well as theoretical exercises at the end of each chapter Thorough examination of numerous applications Investigation of the latest developments in the field Discussion of future research developments CD containing software included with book.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordonnancement (Gestion)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Betriebsplanung</subfield><subfield code="0">(DE-588)4006197-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Systemtheorie</subfield><subfield code="0">(DE-588)4058812-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Systemtheorie</subfield><subfield code="0">(DE-588)4058812-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Betriebsplanung</subfield><subfield code="0">(DE-588)4006197-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-0-387-78935-4</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://swbplus.bsz-bw.de/bsz285055240kap.htm</subfield><subfield code="3">Kapitel 2</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://swbplus.bsz-bw.de/bsz285055240vor.htm</subfield><subfield code="3">Vorwort 1</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://swbplus.bsz-bw.de/bsz285055240inh.htm</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Klappentext</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection>
genre	(DE-588)4123623-3 Lehrbuch gnd-content
genre_facet	Lehrbuch
id	DE-604.BV035075003
illustrated	Illustrated
index_date	2024-07-02T22:05:13Z
indexdate	2025-02-20T07:06:31Z
institution	BVB
isbn	9780387789347
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016743339
oclc_num	254330458
open_access_boolean
owner	DE-703 DE-M347 DE-945 DE-739 DE-91G DE-BY-TUM DE-384 DE-862 DE-BY-FWS
owner_facet	DE-703 DE-M347 DE-945 DE-739 DE-91G DE-BY-TUM DE-384 DE-862 DE-BY-FWS
physical	XVI, 671 S. Ill., graph. Darst. CD-ROM (12 cm)
publishDate	2008
publishDateSearch	2008
publishDateSort	2008
publisher	Springer
record_format	marc
spellingShingle	Pinedo, Michael Scheduling theory, algorithms, and systems Ordonnancement (Gestion) Production scheduling Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd Betriebsplanung (DE-588)4006197-8 gnd Operations Research (DE-588)4043586-6 gnd Systemtheorie (DE-588)4058812-9 gnd
subject_GND	(DE-588)4047360-0 (DE-588)4242167-6 (DE-588)4179449-7 (DE-588)4037944-9 (DE-588)4006197-8 (DE-588)4043586-6 (DE-588)4058812-9 (DE-588)4123623-3
title	Scheduling theory, algorithms, and systems
title_auth	Scheduling theory, algorithms, and systems
title_exact_search	Scheduling theory, algorithms, and systems
title_exact_search_txtP	Scheduling theory, algorithms, and systems
title_full	Scheduling theory, algorithms, and systems Michael L. Pinedo
title_fullStr	Scheduling theory, algorithms, and systems Michael L. Pinedo
title_full_unstemmed	Scheduling theory, algorithms, and systems Michael L. Pinedo
title_short	Scheduling
title_sort	scheduling theory algorithms and systems
title_sub	theory, algorithms, and systems
topic	Ordonnancement (Gestion) Production scheduling Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd Betriebsplanung (DE-588)4006197-8 gnd Operations Research (DE-588)4043586-6 gnd Systemtheorie (DE-588)4058812-9 gnd
topic_facet	Ordonnancement (Gestion) Production scheduling Produktionsplanung Reihenfolgeproblem Scheduling Mathematik Betriebsplanung Operations Research Systemtheorie Lehrbuch
url	http://swbplus.bsz-bw.de/bsz285055240kap.htm http://swbplus.bsz-bw.de/bsz285055240vor.htm http://swbplus.bsz-bw.de/bsz285055240inh.htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016743339&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT pinedomichael schedulingtheoryalgorithmsandsystems

Verfügbarkeit

Inhaltsverzeichnis
Inhaltsverzeichnis

THWS Schweinfurt Zentralbibliothek Lesesaal

Bestandesangaben von THWS Schweinfurt Zentralbibliothek Lesesaal
Signatur:	2000 QH 465 P649(3)
Exemplar 1	ausleihbar Verfügbar Bestellen

MARC

Datensatz im Suchindex

THWS Schweinfurt Zentralbibliothek Lesesaal

Ähnliche Einträge