Skip to main content

Metaheuristics for Scheduling in Industrial and Manufacturing Applications

  • Book
  • © 2008

Overview

  • First book on scheduling problems in Grid, P2P and other Emergent Computational Systems
  • Includes supplementary material: sn.pub/extras

Part of the book series: Studies in Computational Intelligence (SCI, volume 128)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

Keywords

About this book

During the past decades scheduling has been among the most studied op- mization problemsanditisstillanactiveareaofresearch!Schedulingappears in many areas of science, engineering and industry and takes di?erent forms depending on the restrictions and optimization criteria of the operating en- ronments [8]. For instance, in optimization and computer science, scheduling has been de?ned as “the allocation of tasks to resources over time in order to achieve optimality in one or more objective criteria in an e?cient way” and in production as “production schedule, i. e. , the planning of the production or the sequence of operations according to which jobs pass through machines and is optimal with respect to certain optimization criteria. ” Although there is a standardized form of stating any scheduling problem, namely “e?cient allocation ofn jobs onm machines –which can process no more than one activity at a time– with the objective to optimize some - jective function of the job completion times”, scheduling is in fact a family of problems. Indeed, several parameters intervene in the problem de?nition: (a) job characteristics (preemptive or not, precedence constraints, release dates, etc. ); (b) resource environment (single vs. parallel machines, un- lated machines, identical or uniform machines, etc. ); (c) optimization criteria (minimize total tardiness, the number of late jobs, makespan, ?owtime, etc. ; maximize resource utilization, etc. ); and, (d) scheduling environment (static vs. dynamic,intheformerthenumberofjobstobeconsideredandtheirready times are available while in the later the number of jobs and their charact- istics change over time).

Reviews

From the reviews:

"This balanced collection of 13 chapters presents quality research, with each chapter describing an industrial or manufacturing case related to scheduling. … The use of heuristics is very appropriate for most scheduling problems … . The problems, methods, and approaches presented in the book are very diverse, offering a good starting point for solving most practical scheduling problems. … An advantage of the book--the diversity of the problems and solutions presented … ." (Waldemar Koczkodaj, ACM Computing Reviews, October, 2009)

Editors and Affiliations

  • Department of Languages and Informatics Systems, Polytechnic University of Catalonia, Barcelona, Spain

    Fatos Xhafa

  • Norwegian Center of Excellence Center of Excellence for Quantifiable Quality of Service, Norwegian University of Science and Technology, Trondheim, Norway

    Ajith Abraham

Bibliographic Information

Publish with us