Scheduling Algorithms

by Peter Brucker

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

MoreLess

Year of publication:	1998 ; Second, Revised and Enlarged Edition
Authors:	Brucker, Peter
Publisher:	Berlin : Springer
Subject:	Algorithmus \| Algorithm \| Scheduling-Verfahren \| Scheduling problem \| Theorie \| Theory

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Extent:	Online-Ressource (XII, 342 p) digital
Type of publication:	Book / Working Paper
Language:	English
Notes:	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.
ISBN:	978-3-662-03612-9 ; 978-3-662-03614-3
Other identifiers:	10.1007/978-3-662-03612-9 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10013518475