EP1451733A1 - Procede et dispositif pour surveiller des flux de marchandises - Google Patents

Procede et dispositif pour surveiller des flux de marchandises

Info

Publication number
EP1451733A1
EP1451733A1 EP01978758A EP01978758A EP1451733A1 EP 1451733 A1 EP1451733 A1 EP 1451733A1 EP 01978758 A EP01978758 A EP 01978758A EP 01978758 A EP01978758 A EP 01978758A EP 1451733 A1 EP1451733 A1 EP 1451733A1
Authority
EP
European Patent Office
Prior art keywords
article
item
positions
rule
events
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP01978758A
Other languages
German (de)
English (en)
Inventor
Sergej Toedtli
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Orell Fuessli Security Documents AG
Original Assignee
Orell Fuessli Security Documents AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Orell Fuessli Security Documents AG filed Critical Orell Fuessli Security Documents AG
Publication of EP1451733A1 publication Critical patent/EP1451733A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Definitions

  • the invention relates to a method and
  • the object of the present invention is to provide a method and a device of the type mentioned at the outset, which allows better monitoring of a flow of goods.
  • event numbers are determined for each article, which are assigned to the respective transitions or article positions. An event number thus indicates how often the article has passed the corresponding transition or how often it has reached the corresponding article position.
  • the checking rule preferably defines maximum permissible number of events for at least some of the transitions and / or item positions.
  • the warning is issued if at least one of the event numbers of an article exceeds the corresponding maximum permitted number of events. For example, it can be determined that an article can never reach a certain article position and / or never go through a certain transition. For this purpose, the maximum number of events assigned to it is set to zero. It can also be provided that an article is repeated several times, but the highest e.g. May go through a certain transition 10 times. In this case, the corresponding maximum number of events is set to 10.
  • 1 is a schematic representation of a distribution network
  • FIG. 2 shows the database entry for a first embodiment of the invention
  • FIG. 3 shows the database entry for a second
  • Fig. 4 shows the database entry for a third embodiment of the invention.
  • FIG. 1 shows an example of a possible implementation of a distribution network for a certain type of article.
  • the square symbols indicate the possible item positions P1, P2, ..., the arrows some of the possible transitions.
  • POS Point of Halls
  • the items do not always move linearly from top to bottom.
  • the central stores P2, P3, P4 can exchange items with one another and, depending on the agreement, also the sales outlets. It is also conceivable that a sales point can be supplied by different central warehouses. Material flows "upwards" are also possible, e.g. if a point of sale sends an article back to a central warehouse or if an end user returns an article.
  • arrows in Fig. 1 show some of the possible transitions between the item positions.
  • a computer 1 is provided.
  • the latter operates a database 2 in which the data described below are recorded.
  • It is also connected to input devices for the individual item positions. These can be bar code readers or manually operated input terminals, for example. With these input devices, the computer 1 is informed when a Item reaches an item position and when he leaves it.
  • each article is assigned a unique article number, which can be recorded on the article itself or on a packaging of the article, for example.
  • Various embodiments of the method according to the invention are described below.
  • an entry is made in the database for each individual article, which records several “event numbers” of the respective article or allows the event numbers to be determined from the data recorded for the article. Each event number describes how often the article is sent to a specific article Item position has arrived or how often the item has gone through a transition between two item positions.
  • FIG. 2 shows a first embodiment of a corresponding database entry for an article.
  • ten counters for event numbers pl, p2, ... plO are provided for each article, which record how often the article has reached the respective article position.
  • an entry labeled "Log” is provided, which describes the history of the article in detail as it was recorded at the article positions due to the entries in the input devices.
  • the entry stores, among other things, when the article reached which article position and when he left it. In this case, the item has moved from position P1 to P2 and from there to P5. In P5 it was sold twice and returned twice, so the number of events p5 is 2.
  • this rule can e.g. have the following form:
  • R (pl, ..., plO) fulfilled if pi ⁇ Li applies to all i otherwise not fulfilled
  • Ll, L2, L3, ... are the maximum permissible number of events, i.e. Limit values for the event numbers pl to plO.
  • the rule R is fulfilled if none of the event numbers pi is greater than the respective maximum permissible number of events Li.
  • an article can be closed up to five times to every central warehouse, but only twice to the same point of sale.
  • This checking rule would be fulfilled by the example according to FIG. 2 - however, if a sale and a return still take place at the same point of sale, the checking rule is no longer fulfilled.
  • a warning is issued.
  • the warning can e.g. to the operator of the
  • FIG. 3 A second embodiment of the invention is shown in FIG. 3.
  • 11 x 11 event numbers t__ H are recorded in the database entry.
  • this rule can e.g. have the following form:
  • R (tj_ j) fulfilled if ti ( j ⁇ Mi ( j, otherwise not fulfilled, applies to all i, j,
  • Mj_ ⁇ are maximum allowable event numbers, ie limit values for the 'event numbers tj ⁇ .
  • the second version has the advantage that certain distribution channels can be blocked in a simple manner.
  • the values Mj ⁇ j for i and j between 5 and 10 can be set to 0, ie a direct transition of items between the sales items is not permitted.
  • the values M_ ⁇ (for all i) can also be set to zero, since a corresponding transition gives an indication of an error state.
  • the second embodiment also allows transitions in different directions between two positions Pi and Pj to be assigned different maximum admissible event numbers.
  • Fig. 4 shows a third embodiment of the invention.
  • the item positions P5 to PlO are combined into a single item position.
  • a binary list of states is specified for each article instead of the counter, which are numbered 1.1 to 3.6 in the example.
  • Each status can be marked with a status flag. If the flag is set, the corresponding state has been assumed. In this case, it cannot be taken again.
  • the third embodiment according to FIG. 4 functions similarly to the first embodiment according to FIG. 2 if 2 all sales items are combined into a single item position.
  • the third version counts, for example, how often an article arrives at the item position "Point Of Halls".
  • the first time condition 3.1 is set, the second time condition 3.3 and the third time condition 3.5.
  • the article must not occupy the article position more than three times.
  • the database 2 is preferably designed in all versions in such a way that the number of events cannot be reduced, but only increased, i.e. at least for one user group, there is no user interface for a reduction, but only for an increase in the number of events. This can reduce the risk of improper manipulation of the database.
  • this can be achieved in that the values pi and t-j ⁇ can only be increased, but not reduced.
  • this is achieved in that the status flags can be set, but not reset.
  • the event numbers can have different meanings and they can be saved in different ways. It is also possible to combine the different designs of the invention. For example, it is conceivable to record both the event numbers pi from the first example and the event numbers t t -j from the second example and to take them into account in the checking rule.
  • the checking rule R can be the same for all articles, or it can be individually adapted to each article or to subgroups of the articles.
  • the database entry of each article also contains information on how the checking rule should look like. For example, it can be stipulated for an article that it may not reach certain article positions, while another article (e.g. sold under different conditions or fulfilling other quality criteria) may reach all article positions.
  • the device according to the invention for carrying out the method described here comprises e.g. the computer 1, the database 2 and a program for performing the steps described.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé pour surveiller un flux d'articles à travers à un réseau de distribution comprenant des positions d'articles (P1, P2,...) et des jonctions reliant lesdites positions d'articles. Les mouvements de chaque article sont consignés dans une banque de données (2). Selon ce procédé, des nombres d'événements sont déterminés pour chaque article, lesdits nombres indiquant la fréquence de passage d'un article à travers une jonction donnée ou sa fréquence d'occupation d'une position d'article donnée. Les nombres d'événements sont vérifiés pour permettre de déterminer s'ils satisfont à certains critères. Une alerte est déclenchée lorsqu'ils ne satisfont pas à ces critères. Cette procédure permet de localiser, selon les critères, des activités de marché gris, des inefficacités ou des articles défectueux par exemple.
EP01978758A 2001-11-06 2001-11-06 Procede et dispositif pour surveiller des flux de marchandises Withdrawn EP1451733A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2001/002074 WO2003040973A1 (fr) 2001-11-06 2001-11-06 Procede et dispositif pour surveiller des flux de marchandises

Publications (1)

Publication Number Publication Date
EP1451733A1 true EP1451733A1 (fr) 2004-09-01

Family

ID=11004204

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01978758A Withdrawn EP1451733A1 (fr) 2001-11-06 2001-11-06 Procede et dispositif pour surveiller des flux de marchandises

Country Status (3)

Country Link
US (1) US20040254801A1 (fr)
EP (1) EP1451733A1 (fr)
WO (1) WO2003040973A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104636990B (zh) * 2015-02-17 2018-10-02 国家电网公司 基于n-1准则的电网设备停运原因实时排查及预警方法
CN113191708A (zh) * 2021-04-16 2021-07-30 上海东普信息科技有限公司 物流配送监控方法、装置、设备及存储介质

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4336589A (en) * 1980-04-07 1982-06-22 Rapistan Division, Lear Siegler, Inc. Warehousing monitor and control system
US4816824A (en) * 1980-06-23 1989-03-28 Light Signatures, Inc. Merchandise verification and information system
ES2106316T3 (es) * 1991-11-22 1997-11-01 Engineered Data Products Inc Aparato para generar etiquetas.
DE69425947T3 (de) * 1993-11-24 2004-05-13 Brother Kogyo K.K., Nagoya Banddrucker
US5594226A (en) * 1994-07-11 1997-01-14 Steger; Paul Automated check verification and tracking system using bar code information
DE19614719C2 (de) * 1996-04-15 1998-02-19 Aesculap Ag & Co Kg Verfahren und Einrichtung zur Überwachung und Steuerung des Materialflusses in einem Krankenhaus
US6026378A (en) * 1996-12-05 2000-02-15 Cnet Co., Ltd. Warehouse managing system
US6148291A (en) * 1998-01-26 2000-11-14 K & T Of Lorain, Ltd. Container and inventory monitoring methods and systems
US7437305B1 (en) * 1999-05-11 2008-10-14 Christopher Angel Kantarjiev Scheduling delivery of products via the internet
DE19928531A1 (de) * 1999-06-22 2001-01-04 Deutsche Telekom Ag Verfahren und System zur automatisierten Überwachung von Warenflüssen
US6507852B1 (en) * 2000-04-17 2003-01-14 Ncr Corporation Location-independent service for monitoring and alerting on an event log

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO03040973A1 *

Also Published As

Publication number Publication date
US20040254801A1 (en) 2004-12-16
WO2003040973A1 (fr) 2003-05-15

Similar Documents

Publication Publication Date Title
EP0992903B1 (fr) Méthode pour l'implémentation de traitement multitâche coopératif dans un réseau de transmission de messages et élément de réseau associé
EP0948416B1 (fr) Procede de tri sequentiel de distribution
EP3690580B1 (fr) Visualisation simultanée de données de processus et d'alarmes
WO2002013015A1 (fr) Systeme de determination d'origines d'erreur
DE10297609T5 (de) Verfahren und System zum Senden von lokalisierungs- und identitätsabhängiger Information an mobile Endgeräte
WO2003040973A1 (fr) Procede et dispositif pour surveiller des flux de marchandises
DE102008053274A1 (de) Verfahren zur Steuerung einer Mehrzahl von Produktionsprozessen
EP0770946B1 (fr) Procédé pour concevoir automatiquement la redondance optimale pour des mesures dans le système de controle des centrales électriques
EP1561172B1 (fr) Dispositif offrant l'acces a des donnees
WO2004040483A2 (fr) Prevision du degre de respect des delais de livraison dans la fabrication en serie
DE19644680A1 (de) Verfahren und Vorrichtung zur Handhabung von Kennzeichnungsdaten einer Mehrzahl von Komponenten eines Produktes
Hinrichs Datenqualitätsmanagement in Data Warehouse-Umgebungen
EP1169672B1 (fr) Systeme et procede permettant le controle de qualite sur une chaine de production
DE29602226U1 (de) Anordnung zur Integration von EDV-Systemen mit Industrie-Steuerungselementen
EP1708062A1 (fr) Dispositif et procédé destinés à la gestion de données attribuées à un objet complexe
DE102005042643A1 (de) Kommissionierverfahren
EP1298840A1 (fr) Gestion de la performance d'un réseau
EP1376383A2 (fr) Mèthode de traitement de données d'entré et de sortie pour une analyse statistique et mèthode pour éliminer de données rédondantes
EP1491976B1 (fr) Système de saisie et traitement de données pour controller un procédé de fabrication
EP1032868B1 (fr) Procede pour determiner la disponibilite d'une installation technique
EP3147837A1 (fr) Optimisation d'un reseau logistique
WO2002061512A2 (fr) Procede d'entretien et de gestion d'une installation de fabrication
DE102020209512A1 (de) Verfahren und Vorrichtung zum Bestimmen eines Betriebszustands mindestens einer Anwendung
WO2006081918A2 (fr) Systeme de controle pour commander des modules logiciels
EP1519255A2 (fr) Appareil, méthode et produit de programme informatique pour la gestion centralisée d'une pluralité de systèmes électromécaniques

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20040526

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20060503