daa Flashcards
Assignment strategies are an efficient method to assign orders to resources and mainly used to solve?
A. offline problem
B. online problem
C. batch problem D. sequencing problem
online problem
are used to determine the relevant problem because the runtime of the exact algorithm is too long. A method under TSP and tour planning problem
A. Heuristics B. Exact
C. maximization D. optimization
heuristics
The TSP can be opened by finding the best successor or the strip strategy. At the best successor method the order with the distance is chosen out of an order pool as successor of the starting order.
A. shortest B. longest
C. standard D. close
shortest
The optimal sequencing of picking orders can also be described and solved as the?
A. “travelling salesman problem” C. Multiple cycles
B. Single distances and overall path D. Transport optimization
traveling salesman problem
A time-phased algorithm solved in a problem-based, predetermined number of computing steps
A. Finiteness B. Clearness
C. Effectiveness D. Efficiency
finiteness
defines the computation time of an algorithm and thus is of vital importance for its development and use.
A. complexity C. availability
B. consistency D. organize
complexity
The algorithm is always closely related to the predictability of the solution quality while the term is used for those procedures where the quality of the solution cannot be predicted.
A. heuristics B. Efficiency
C. Sequencing D. Clearness
heuristics
In comprehensive order dispatching, An order transmitted to the WMS generally consists of the following elements except one
A. Order number B. Customer number
C. Number of articles to be delivered for this order D. Description of order
description order
At the heuristics the picker passes un aisles if it contains at least one target shelf. The aisles are passed in a predetermined order either left to right or the oder way round.
A. Largest-Gap B. Meander
C. Center D. Branch line
meander
is the distance between two neighbouring shelves to be approached the distance from the aisle to the next shelf, is that part of the aisle which is not passed.
A. Largest-Gap B. Meander
C. Center D. Branch line
largest-gap
The algorithm requires minimum disk space and computing time.
A. Finiteness B. Clearness
C. Effectiveness D. Efficiency
efficiency
An algorithm, by which the way between a starting node and a target note can be determined in a graph
A. Dijkstra B. Batch Calculation
C. Order picking D. Branch line
dijkstra
Within a batch all received orders have to be arranged and assigned to the warehouse resources as to achieve the shortest possible processing time in line with a continuous system load or utilization of resources. A general term for this kind of problem is?
A. Dijkstra algorithm B. job-shop-scheduling
C. Batch preparation D. Branch line
job-shop-scheduling
is used in different contexts and describes the prearrangement of picking or sorting orders as well as the complete order management in a warehouse.
A. Dijkstra B. batch Calculation
C. Order picking D. Branch line
batch calculation
Tours can be planned with opening procedures which in the first step provide a valid but possibly sub-optimal solution. The solution may be optimized by subsequent improvement processes
A. subsequent improvement processes
B. Sequencing of picking orders
C. Heuristic approach
D. Comprehensive order dispatching
subsequent improvement processes
