Preciso acessar um determinado item de um rack (floor storage) que está lotado de itens.
Digamos que este item esteja no ponto central do rack, para isso terei que percorrer e tirar todos os elementos daquela fila afim de acessar aquele item.
Como faço isso?
Via Google Translate:
How to remove items from the queue to access an item?
I need to access a particular item from a rack (floor storage) that is full of items. Let's say that this item is at the center point of the rack, for that I will have to go through and remove all the elements from that row in order to access that item. How do I do that?
Hi @Luan Wilson De Nadal L, was Parker S's answer helpful? If so, please click the red "Accept" button at the bottom of their answer. Or if you still have questions, add a comment and we'll continue the conversation.
If we haven't heard back from you within 3 business days we'll auto-accept an answer, but you can always unaccept and comment back to reopen your question.
You can access any object in a storage object. Please read through this:
https://docs.flexsim.com/en/19.0/Reference/3DObjects/FixedResources/Rack/Rack.html
You can use this command:
rackgetitembybayandlevel(obj rack, num bay, num level, num itemrank) - This command returns a reference to an item in a given bay and level.
There are easier ways to do this using FlexSim's Warehousing tool, but this is not available in the software version you are using.
It seems you are using Express version and as it already answered here, a lot of features are limited in the software version you are using.
13 People are following this question.
FlexSim can help you understand and improve any system or process. Transform your existing data into accurate predictions.
FlexSim is a fully 3D simulation software environment. FlexSim can be used to simulate any process in any industry.
FlexSim®, FlexSim Healthcare™, Problem Solved.®, the FlexSim logo, the FlexSim X-mark, and the FlexSim Healthcare logo with stylized Caduceus mark are trademarks of FlexSim Software Products, Inc. All rights reserved.
