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.
"synopsis" may belong to another edition of this title.
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.
Scheduling is a diverse research area, and scheduling problems arise from many application domains, such as production systems, logistics and computer science. Solving scheduling problems requires the use and knowledge of tools such as combinatorial optimization and exact or approximated algorithms.
Flexibility is at the interface between predictive deterministic approaches and reactive or 'on-line' approaches. It exists when some information (which may not be complete or perfect) about the problem is known, which is fairly reliable and where it is likely that there will be a difference between the forecast plan and its execution. the purpose of flexibility is to provide on or more solutions tailored to the nature of the application in order to provide the ideal solution. Robustness, which characterizes the performance of an algorithm when data are subject to uncertainty, is defined as being able to be resistant to approximations and ignorance.
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, treating them with an emphasis on either flexibility o robustness, or both.
Scheduling is a diverse research area, and scheduling problems arise from many application domains, such as production systems, logistics and computer science. Solving scheduling problems requires the use and knowledge of tools such as combinatorial optimization and exact or approximated algorithms.
Flexibility is at the interface between predictive deterministic approaches and reactive or 'on-line' approaches. It exists when some information (which may not be complete or perfect) about the problem is known, which is fairly reliable and where it is likely that there will be a difference between the forecast plan and its execution. the purpose of flexibility is to provide on or more solutions tailored to the nature of the application in order to provide the ideal solution. Robustness, which characterizes the performance of an algorithm when data are subject to uncertainty, is defined as being able to be resistant to approximations and ignorance.
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, treating them with an emphasis on either flexibility o robustness, or both.
"About this title" may belong to another edition of this title.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5582493-n
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Seller Inventory # 9781848210547
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 5582493
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 5582493
Quantity: Over 20 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781848210547
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 5582493-n
Quantity: Over 20 available
Seller: Ubiquity Trade, Miami, FL, U.S.A.
Condition: New. Brand new! Please provide a physical shipping address. Seller Inventory # 9781848210547
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 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. Editor(s): Billaut, Jean-Charles; Moukrim, Aziz; Sanlaville, Eric. Series: ISTE. Num Pages: 352 pages, Illustrations. BIC Classification: KJMV5. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 239 x 163 x 24. Weight in Grams: 646. . 2008. 1st Edition. Hardcover. . . . . Seller Inventory # V9781848210547
Seller: moluna, Greven, Germany
Gebunden. Condition: New. 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 algori. Seller Inventory # 597090975
Quantity: Over 20 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 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. Editor(s): Billaut, Jean-Charles; Moukrim, Aziz; Sanlaville, Eric. Series: ISTE. Num Pages: 352 pages, Illustrations. BIC Classification: KJMV5. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 239 x 163 x 24. Weight in Grams: 646. . 2008. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland. Seller Inventory # V9781848210547