Matlab Programming
WiredWhite
There is a storage area with W stacks and H tiers. Elements arrive in the storage area and are assigned to a position (i,j) in the order of arrival (e.g. element 6,3,5,1,2,4,7). where i is the stack and j is the level in that stack. After storage, the elements are swapped out again, but in a different order than they came in, namely 1,2,3,4,5,6,7. Element 1 is picked up in period 1, element 2 in period 2, and so on. It is possible that elements that are swapped out are blocked by other elements because they are on top of them in the stack, but are only fetched later. In this case, the blocking elements must be moved/relocated. This number of necessary rearrangements during outsourcing should already be minimized during placement when storing.
The mathematical model formulation solves this problem optimally for small instances, e.g. three stacks and three levels.
For larger instances, a heuristic should be implemented that provides a valid solution. Not necessarily the best. (mapping problem)
You must sign in to apply for this position.
