29,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
15 °P sammeln
  • Broschiertes Buch

Factories and delivery companies usually tackle the problem of scheduling so that they could receive the most profitable outcome of their work. One of the real-world examples is minimizing the makespan of a conveyor system finding the appropriate sequence of orders to be processed. In computer science or operations research, this case can be interpreted as the Job Shop Scheduling (JSS) problem. However, JSS is a hard combinatorial optimization problem. Precise optimization methods cannot be applied because it will take years of searching for the optimal result. Therefore, metaheuristics are usually used to solve this type of problem.…mehr

Produktbeschreibung
Factories and delivery companies usually tackle the problem of scheduling so that they could receive the most profitable outcome of their work. One of the real-world examples is minimizing the makespan of a conveyor system finding the appropriate sequence of orders to be processed. In computer science or operations research, this case can be interpreted as the Job Shop Scheduling (JSS) problem. However, JSS is a hard combinatorial optimization problem. Precise optimization methods cannot be applied because it will take years of searching for the optimal result. Therefore, metaheuristics are usually used to solve this type of problem.
Autorenporträt
Roman Slonskyi hat einen BSc. und absolviert derzeit einen MSc. im Bereich Informatik an der Slowakischen Technischen Universität in Bratislava. Er verfügt über umfassende Erfahrung in der Softwareentwicklung. Darüber hinaus interessiert er sich für die Lösung verschiedener Optimierungsprobleme mit Hilfe künstlicher Intelligenz.