Production Management at TU München

The standard greedy method assumes that every object has the same size

In vogels aproxx method you first satisfy those demands which can be satisfied with the lowest cost

Binary Sorting is a common method for the configuration of flow lines

If task j follows task i in the CPM, the earliest feasible start time of j always equals the eraliest feasible end time of i 

Assembly line balancing for the product variants with fixed cycle time using a "hybrid" to determine the minimum workstations does not always generate a feasible solution 

An assumption of layout planning is that the floor space is a square 

In classic transportation planning, transport and production quantities are estimated over multiple periods

Production cost are identical for each plant 

In the classic transportation model, only one product and one period, but several production locations are considered

The greedy method assumes that the value of the proxy criterion is given from the start

The distance is always measured rectangularly in layout planning

Since Vogels aprox. method considers production and transportation cost, the optimal solution is always found