Knygos.lt klubas Knygos.lt nariams
83,57 €
-30%
Įprastai
119,39 €
Job Shop Scheduling with Consideration of Due Dates
Job Shop Scheduling with Consideration of Due Dates
Knygos.lt klubas Knygos.lt nariams
83,57 €
-30%
Įprastai
119,39 €
  • Išsiųsime per 12–18 d.d.
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.
  • Leidėjas:
  • Metai: 2015
  • Puslapiai: 190
  • ISBN-10: 3658102918
  • ISBN-13: 9783658102913
  • Formatas: 14.8 x 21 x 1.3 cm, minkšti viršeliai
  • Kalba: Anglų

Job Shop Scheduling with Consideration of Due Dates (el. knyga) (skaityta knyga) | knygos.lt

Atsiliepimai

Aprašymas

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.

Knygos.lt klubas
Knygos.lt nariams
83,57 €
-30%
Įprastai
119,39 €
Kaina registruotiems pirkėjams
Prisijunkite ir už šią prekę
gausite 1,19 Knygų Eurų!?
Išsiųsime per 12–18 d.d.
Įsigykite dovanų kuponą
Daugiau
  • Autorius: Jens Kuhpfahl
  • Leidėjas:
  • Metai: 2015
  • Puslapiai: 190
  • ISBN-10: 3658102918
  • ISBN-13: 9783658102913
  • Formatas: 14.8 x 21 x 1.3 cm, minkšti viršeliai
  • Kalba: Anglų

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.

Atsiliepimai

  • Atsiliepimų nėra
0 pirkėjai įvertino šią prekę.
5
0%
4
0%
3
0%
2
0%
1
0%
(rodomas nebus)
× Akcija + knyga už 1ct