Nehodí sa? Žiadny problém! U nás môžete do 30 dní vrátiť
S darčekovým poukazom nešliapnete vedľa. Obdarovaný si za darčekový poukaz môže vybrať čokoľvek z našej ponuky.
30 dní na vrátenie tovaru
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.
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?