118,61 €
131,79 €
-10% with code: EXTRA
Job Shop Scheduling with Consideration of Due Dates
Job Shop Scheduling with Consideration of Due Dates
118,61
131,79 €
  • We will send in 10–14 business days.
Jens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted tardiness as objective. First, he provides a suitable graph representation based on a disjunctive graph formulation. Second, several key components of local search procedures are analyzed and enhanced. The resulting outputs of these investigations contribute to the development of a new solution procedure whose performance quality leads to superior computational results.
  • Publisher:
  • Year: 2015
  • Pages: 190
  • ISBN-10: 3658102918
  • ISBN-13: 9783658102913
  • Format: 14.8 x 21 x 1.3 cm, softcover
  • Language: English
  • SAVE -10% with code: EXTRA

Job Shop Scheduling with Consideration of Due Dates (e-book) (used book) | bookbook.eu

Reviews

Description

Jens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted tardiness as objective. First, he provides a suitable graph representation based on a disjunctive graph formulation. Second, several key components of local search procedures are analyzed and enhanced. The resulting outputs of these investigations contribute to the development of a new solution procedure whose performance quality leads to superior computational results.

EXTRA 10 % discount with code: EXTRA

118,61
131,79 €
We will send in 10–14 business days.

The promotion ends in 20d.17:53:36

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,32 Book Euros!?
  • Author: Jens Kuhpfahl
  • Publisher:
  • Year: 2015
  • Pages: 190
  • ISBN-10: 3658102918
  • ISBN-13: 9783658102913
  • Format: 14.8 x 21 x 1.3 cm, softcover
  • Language: English English

Jens Kuhpfahl analyzes the job shop scheduling problem with minimizing the total weighted tardiness as objective. First, he provides a suitable graph representation based on a disjunctive graph formulation. Second, several key components of local search procedures are analyzed and enhanced. The resulting outputs of these investigations contribute to the development of a new solution procedure whose performance quality leads to superior computational results.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)