flexibility robustness scheduling (11 résultats)

Etat : New.

Etat : New. Brand New.

Etat : As New. Unread book in perfect condition.

Etat : As New. Unread book in perfect condition.

Hardcover. Etat : 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.

Etat : New.

Etat : New. Brand new! Please provide a physical shipping address.

Etat : 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. . . . .

Gebunden. Etat : 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.

Etat : 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.

Hardcover. Etat : 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.