net/publication/303033830
CITATIONS READS
0 23
2 authors:
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by José A Basto on 13 May 2016.
José A. Basto
António C. Brito
OUT IN
This correspondence between racks led to an increase of The task of boxes picking raises the biggest problem in
the structure of data “racks”, at the CONFIG program, the reserve of position in input/output stations, because
where the routines of creation, elimination or repetition this case may be much more than a single trip from a
of racks have now to contemplate the new transfer rack to a truck (or vice versa), always in the same flow
stations. direction. The order of boxes may have multiple
delivery points, located in dispersed racks of the
The IDUMP program was expanded with the creation of warehouse, what may lead to the situation that is
the new entity TRANSFER STATION, with new queues represented in Figure 2, in which the single cell stations
of free and busy cells (for exit and/or entrance, serve both functions (this is a worst case scenario).
depending on the characteristics of each station) and the
extension of the set of attributes of the rack to keep the The procedure to perform includes the following steps:
pointers for its eventual transfer stations. The possible (i) In the arrival of a pallet to the transfer station I
transfers inside the warehouse are presented in Figure 1. (see Figure 2), the pointer for the delivery cell of boxes
“1” is obtained from the picking list; Next, it verifies if
In the beginning of the process of handling a pallet to its the rack to which this delivery point belongs is assigned
position of destination, is verified if the “target” rack (or not) an input transfer station. In the affirmative case,
has assigned a delivery station. If this condition applies, it is verified if it exists a free position in this station. If
a sub-routine gets a pointer to a free position in the this condition is also met, we will be in conditions to
transfer “buffer”, being this cell immediately locked for initiate next check (before trip “A” starts);
the transit of entity PALLET that triggered the event. In (ii) Still in the transfer station I, verifies if the
the absence of a free position, the PALLET is blocked station II is also an exit station. If affirmative, the task
until a cell in the station is freed. of “boxes picking” immediately reserves the same
The transfer of pallets through exit stations involves position in station II as exit and entry point, anticipating
problems related with the existence of free positions in the return of pallet to the station II (trip “B”, in figure 2)
the marshaling zone (in the eventuality of the routing
includes this zone): it does not justify the locking of a
BOXES PICKING RACKS
position in an pick-up station if it is forecasted that this
resource (in general, scarce) will be blocked until
becoming vacant a needed downstream position.
Therefore, it was decided to never reserve a cell at
stations without before-hand make sure that all the
remaining passage points are available.
1
This priority of keeping the stations as available as
B
possible was also included in the new logic of the
restocking task of “boxes picking points”. If the trip I II
includes a short stop at the exit station of the storage
rack (full pallets) and another stop at the station of
A
entrance to the rack of boxes picking, this task will only
reserve position in the stations when it will be possible PICK-UP/DELIVERY STATION
to lock simultaneously the cells in the two midway
Figure 2: Warehouse Transfers using Pick-up and
buffers.
Delivery Stations
The underlying motive to this procedure is to prevent the events related to the operations, etc, keeping also the
that a mixed pallet is blocked in an aisle. The statistics of the times in each one of its possible states,
subdivision of the task “boxes picking” still compels indicated at the icon of the machine by a small colored
numerous tests of accessibility of the transporters to the flag:
various points where the routing takes the pallet, in
contrast to the procedure followed by the first version of (i) SETUP: Preparation of the machine (blue flag)
system AWARD, in which the same transporter were in (ii) OPERATION: Processing of the materials in the
charge to fulfil the order “boxes picking” from start to machine (green flag);
finish. (iii) STARVING: the machine stops by lack of raw
material (red flag);
(iv) REQUEST: the machine send to the central
Manufacturing Logistics and AS/RS
controller a supplying order (yellow flag).
EFACEC entered a new bid for building an automatic REQUEST may coexist with state (SETUP) or with
warehouse designed to supply raw material to machines state (OPERATION), preceding always state
integrated in a large production system. These (STARVING)
functionalities required new options to be added to the
simulator AWARD, not yet prepared to model
INDUSTRIAL APLICATION EXAMPLE
manufacturing logistics systems with Automated
Storage and Retrieval Systems (AS/RS). The new functionalities of system AWARD were used
for the simulation of an automatic warehouse designed
On input data side, it was necessary to create a new data by EFACEC for a component supplier in the
structure to describe the operations of each machine. competitive automotive industry.
The new files (one for each machine) include the
information of the operations to be executed in the The problem required the supply of raw materials to 38
machine, namely: the codes of the necessary raw machines. The layout is presented in Figure 3, a screen
materials, the amounts to be used; set-up and processing shoot of the full model, in which we can see the storage
times for each operation. racks, with seven levels, in two sections, each served by
an automatic transporter.
It was also needed to widen the logic of the warehouse
zones, in order to define zones of direct supplying to
machines and buffers for empty pallets.