|
|
|||
|
||||
OverviewBesides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multipurpose machines. The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized. Full Product DetailsAuthor: Peter BruckerPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2nd revised & enlarged ed Weight: 0.499kg ISBN: 9783540641056ISBN 10: 354064105 Pages: 342 Publication Date: 29 April 1998 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsClassification 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |