Scheduling Algorithms
By: by Peter Brucker
Publisher: Springer Berlin Heidelberg
Published: 1995
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 326
ISBN-13: 9783662030905; 9783662030882
Subjects: Engineering economy; Economics; Operations research; Management information systems
Description: Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Contents: Classification of Scheduling Problems; title: Some Problems in Combinatorial Optimization; title: Computational Complexity; title: Single Machine Scheduling Problems; title: Parallel Machines; title: Shop Scheduling Problems; title: Due-Date Scheduling; title: Batching Problems; title: Changeover Times and Transportation Times; title: Multiprocessor Tasks; title: Multi-Purpose Machines.