Home » Flexibility and Robustness in Scheduling
Product Image

Flexibility and Robustness in Scheduling

€254.14
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
algorithms
application domains
area
arise
between
Category=KJMV5
combinatorial
deterministic
diverse
eq_bestseller
eq_business-finance-law
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
fairly
flexibility
information
interface
knowledge
known
many
perfect
problem
problems
production
reliable
research
tools
use

Product details

  • ISBN 9781848210547
  • Weight: 635g
  • Dimensions: 163 x 236mm
  • Publication Date: 02 Dec 2008
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
Description

Scheduling is a broad research area and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and reactive or "on-line" approaches. The purpose of flexibility is to provide one or more solutions adapted to the context of the application in order to provide the ideal solution. This book focuses on the integration of flexibility and robustness considerations in the study of scheduling problems. After considering both flexibility and robustness, it then covers various scheduling problems, treated with an emphasis on flexibility or robustness, or both.
About
Jean-Charles Billaut is Professor in Computer Science in the Polytechnic School of the University of Tours, France. he teaches assembly language and operations research (graph theory and dynamic programming). He is also member of the board of the French OR Society (President in 2006 and 2007).

Aziz Moukrim is Professor in Computer Science at the the University of Technology of Compiegne, France, and is a member of the UTC-CNFRS research laboratory (Heudiasyc). He teaches algorithmic and operations research (Scheduling, logistics and transportation systems). He is also co-leader of the CNRS Group (Scheduling and Transportation Networks).

Eric Sanlaville is Associate Professor In Computer Science at the University of Clermont-Ferrand, France. He teaches algorithmics and operations research (both in deterministic and stochastic settings). He has been a member of het board of the French OR Society since 004.