Check nearby libraries
Buy this book
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.
Check nearby libraries
Buy this book
Previews available in: English
Edition | Availability |
---|---|
1
Scheduling Algorithms
1995, Springer Berlin Heidelberg
electronic resource /
in English
366203090X 9783662030905
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Contents: 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
Multiprocessor Tasks
Multi-Purpose Machines.
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 7, 2019 | Created by MARC Bot | import new book |