WO1999067729A9 - Verfahren und system zur maximierung des bereichs von abdeckungsprofilen bei der bestandsverwaltung - Google Patents
Verfahren und system zur maximierung des bereichs von abdeckungsprofilen bei der bestandsverwaltungInfo
- Publication number
- WO1999067729A9 WO1999067729A9 PCT/EP1999/004229 EP9904229W WO9967729A9 WO 1999067729 A9 WO1999067729 A9 WO 1999067729A9 EP 9904229 W EP9904229 W EP 9904229W WO 9967729 A9 WO9967729 A9 WO 9967729A9
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- solution
- profile
- transport
- range
- distribution
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000004364 calculation method Methods 0.000 claims abstract description 11
- 238000003860 storage Methods 0.000 claims description 11
- 230000003247 decreasing effect Effects 0.000 claims description 3
- 241000269627 Amphiuma means Species 0.000 claims 1
- 230000008878 coupling Effects 0.000 claims 1
- 238000010168 coupling process Methods 0.000 claims 1
- 238000005859 coupling reaction Methods 0.000 claims 1
- 238000009826 distribution Methods 0.000 abstract description 90
- 230000008569 process Effects 0.000 abstract description 16
- 238000009472 formulation Methods 0.000 abstract description 4
- 239000000203 mixture Substances 0.000 abstract description 4
- 230000032258 transport Effects 0.000 description 122
- 238000004519 manufacturing process Methods 0.000 description 51
- 238000013439 planning Methods 0.000 description 33
- 238000005457 optimization Methods 0.000 description 29
- 238000012384 transportation and delivery Methods 0.000 description 17
- 241000196324 Embryophyta Species 0.000 description 13
- 239000000463 material Substances 0.000 description 9
- 238000013459 approach Methods 0.000 description 5
- 238000012432 intermediate storage Methods 0.000 description 5
- 230000009467 reduction Effects 0.000 description 4
- 238000005096 rolling process Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000001934 delay Effects 0.000 description 3
- 230000006698 induction Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 101100075096 Drosophila melanogaster lolal gene Proteins 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 240000000736 Amomum maximum Species 0.000 description 1
- 241001236093 Bulbophyllum maximum Species 0.000 description 1
- 206010012186 Delayed delivery Diseases 0.000 description 1
- 240000008168 Ficus benjamina Species 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 239000013256 coordination polymer Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- RVRCFVVLDHTFFA-UHFFFAOYSA-N heptasodium;tungsten;nonatriacontahydrate Chemical compound O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.[Na+].[Na+].[Na+].[Na+].[Na+].[Na+].[Na+].[W].[W].[W].[W].[W].[W].[W].[W].[W].[W].[W] RVRCFVVLDHTFFA-UHFFFAOYSA-N 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000009776 industrial production Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
- G06Q10/06375—Prediction of business process outcome or impact based on a proposed change
Definitions
- the present invention relates to a method for optimizing transport planning and, in particular, to a method for optimizing the storage ranges in a transport network having a plurality of distribution levels by using a computer-assisted optimization algorithm, in particular for quickly determining schedules for dispatch and production.
- linear programming model One method of presenting such arbitration problems is known as the linear programming model.
- Such a model consists of a series of linear relationships, which are presented in a matrix form and quantitatively represent the relationships between allocations, restrictions and the results of the optimization process. In the linear relationships, the sum of constant coefficients multiplied by unknown allocation values is shown.
- Such modeling of linear programming is achieved in a multidimensional space, with multidimensional vectors providing a multidimensional figure or a polytope, each facet on an area thereof being limited by equations that define relationships between allocated resources in the process.
- One example of a solution to the linear programming problem is the simplex algorithm, which was developed by George Dantzig in 1947.
- a solution alternative is the Karmarkar algorithm.
- Figure 1 is a graphical representation of a simple distribution network.
- Figure 9 is a flow diagram of both possible and optimized transport routes.
- Figure 10 shows another example of possible and optimized transport routes.
- Figure 11 shows the influence of impermissible periods on the possible transport options in a distribution network.
- Figure 12 is a graphical representation of a simple distribution network with time values on the sheets.
- Figure 13 is a graphical representation of the production and demand profiles of a distribution network.
- the classic transport problem differs from the assignment problem in that a node on the left side (now called “producer”) can be assigned to any number of nodes on the right side (now called “consumer”).
- the problem to be solved is how to find a suitable distribution of materials between the nodes so that the so-called inventory area is maximized. This means maximizing the smallest inventory across all nodes and periods.
- the solution with the lowest transport costs should be selected from the possible solutions (solution solution).
- the storage area of a warehouse is defined as the number of consecutive periods (including the current period) for which the current stock is sufficient. A range of 1 thus means that the stock exactly covers the needs of a single period, namely the current period.
- the requirement di (t) depends on the difference in the target inventory Li (t) - Li (tl), which in turn depends on the range R (t)) and the customer order o ⁇ (t)).
- the demand d (t) results in:
- FIG. 11 shows an optimizing network with a horizon of six periods 1102, 1104, 1106, 1108, 1110, 1112.
- the nodes are marked with the distribution network node number i and the associated period number t.
- the impermissible periods are shown hatched / gray. In period 2, goods acceptance in distribution network node 1 is prohibited. The delivery of goods is not permitted in node 2 in period 5. Transport is not permitted in period 3 1114.
- the described distribution of the impermissible periods is of course an extreme case. In most cases, the holiday will affect at least the areas that receive and issue goods at the same time.
- An optimal transport plan for the first period is as follows: The assignment of offers from the first period should not have a negative effect on the area in all periods. The following assumption can significantly reduce the effort of such a search according to this plan. In order to obtain the monotonous optimal transport plan of the first period, it is sufficient to restrict the search for the maximum area profile to those profiles that are not constant only in the initial area, that is, with t ⁇ max irj ⁇ Ti j ⁇ with Tij transport time between nodes i and j. You only have to increase the range profile up to the period of the maximum transport time; in all subsequent periods the profile can have a constant value.
- the optimization network delivers a maximum range profile
- H horizon H briefly the range R ⁇ H ⁇ ⁇ ) is taken over by R ⁇ H ⁇ -l), i.e. if no solution is found, the range in the period becomes H gate . by one
- FIG. 17 shows an example according to the method according to the invention.
- Step 4 1702 shows a step backwards.
- the range in period (time interval) 4 cannot be kept at the value from period 3 and is therefore reduced to a value of 1.25. All previous periods with a larger area are reduced to this area. Then you start to enlarge the area of the affected period again.
- the value found for the range in the last period of the horizon just considered, that is to say R (H kur2 ) represents an upper limit for the range that can be achieved in this period. Since the maximum monotonous profile also tolerates transportation plans that make it impossible to achieve a general maximum profile (for example, in this section), these limits can be used to visualize possible errors in the calculated monotonous profile and possibly react to them interactively.
- R ⁇ is the maximum range that can occur in a period
- R B ⁇ a is the accuracy (granularity) with which this range can be determined
- E- ⁇ is the maximum transport time between two nodes (for the slowest transport mode)
- H lolal is the total horizon (for the total runtime including the runtime for the transport optimizer).
- a combination is particularly useful when an insufficient supply is not just a short-term problem, that is, when production is generally below demand. In this situation, delays would continue to accumulate without reducing demand.
- Part R (t) - LR (t) J is the part that is fulfilled by the next priority class.
- 4 priority classes are defined:
- Forecast Additional demand that is only forecast but has not yet been ordered by a customer.
- a coverage area R (t) 2.7 would mean that at time t all requirements for customers with high and normal priority can be met. For customers with low priority, the degree of fulfillment is 70%.
- the definition of a maximum range profile according to the invention guarantees that no need with a higher priority is satisfied to the disadvantage of a need with a lower priority.
- this problem is solved by introducing additional sheets with reduced transport time.
- the delivery with a delay time ⁇ corresponds to the reduction of the corresponding transport time by ⁇ .
- Delay time The expression 2 C max guarantees that by changing the assignment s 1 (t 1 ) -> d -, (t 3 ) and s 1 - (t 1 -) -> d D '(t 3 a delay cannot be prevented by s 1 (t 1 ) -> d D - (t-, -) and s 1 - (t 1 -) -> d -, (t-,).
- the integer part [R (t) J specifies the number of priority classes whose orders to be fully met.
- the rational part R (t) - [R (t) J is the part that is fulfilled by the next priority class.
- Cost transportation cost + delay penalty cost
- R (t) range of all distribution centers to
- Time t L t) Desired inventory in distribution center j at time t (as a function of range R (t)) s, (t) - supply of the node (production plant) i at time tdt) - demand for nodes (distribution center) j at time t
- Priority class P for distribution center j at time t m t) safety stock in distribution center j at time t
- step 4 Various alternatives to step 4 according to the invention are proposed in the following section.
- the overall problem is first discussed, i.e. the efficient construction of a maximum range of range profiles.
- This algorithm can be significantly accelerated by restricting it to a monotonous range of range profiles, described below.
- the following is a fast algorithm for monotonous profiles to maximize the range profile.
- the actual profile is iteratively increased by 1 whenever this is possible for each time step that spans the entire planning horizon several times.
- R (t): R (t) + l; ⁇ R enlarge ⁇ Generate min_cost_flow problem F (R) for profile R (t)
- R (t): R (t) + ⁇ ; ⁇ R enlarge ⁇ Generate min_cost_flow problem F (R) for profile R (t)
- R m ⁇ x R (t + l) t
- R min ⁇ t
- R (t) R m ⁇ x - 1 ⁇ ; Vt '> t
- R : R (t)' R max - 1;
- Step 4 algorithm - monotonic range of
- the shipping planning y itQ jtj at time t 0 should be expandable to an optimal planning, however the shipping planning for the following time steps may not be optimal. According to the invention, they are corrected by shifting the planning window.
- the range profiles are restricted to the following type: Evenly up to the maximum
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (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)
- General Factory Administration (AREA)
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU51551/99A AU764495B2 (en) | 1998-06-19 | 1999-06-18 | Method and system for maximising the range of stock management requirement profiles |
EP99936457A EP1088283A1 (de) | 1998-06-19 | 1999-06-18 | Verfahren und system zur maximierung des bereichs von abdeckungsprofilen bei der bestandsverwaltung |
JP2000556322A JP2002519265A (ja) | 1998-06-19 | 1999-06-18 | 在庫管理の際のカバープロフィールのレンジを最大化する方法及びシステム |
CA002332995A CA2332995A1 (en) | 1998-06-19 | 1999-06-18 | Method and system for the maximization of the range of coverage profiles in inventory management |
IL13985099A IL139850A (en) | 1998-06-19 | 1999-06-18 | Method and system for the maximization of the range of coverage profiles in inventory management |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US8999698P | 1998-06-19 | 1998-06-19 | |
US60/089,996 | 1998-06-19 | ||
US09/204,772 | 1998-12-03 | ||
US09/204,772 US6341266B1 (en) | 1998-06-19 | 1998-12-03 | Method and system for the maximization of the range of coverage profiles in inventory management |
Publications (2)
Publication Number | Publication Date |
---|---|
WO1999067729A1 WO1999067729A1 (de) | 1999-12-29 |
WO1999067729A9 true WO1999067729A9 (de) | 2000-10-26 |
Family
ID=26781149
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP1999/004229 WO1999067729A1 (de) | 1998-06-19 | 1999-06-18 | Verfahren und system zur maximierung des bereichs von abdeckungsprofilen bei der bestandsverwaltung |
Country Status (7)
Country | Link |
---|---|
US (1) | US6341266B1 (de) |
EP (1) | EP1088283A1 (de) |
JP (1) | JP2002519265A (de) |
AU (1) | AU764495B2 (de) |
CA (1) | CA2332995A1 (de) |
IL (1) | IL139850A (de) |
WO (1) | WO1999067729A1 (de) |
Families Citing this family (68)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6477660B1 (en) * | 1998-03-03 | 2002-11-05 | Sap Aktiengesellschaft | Data model for supply chain planning |
DE19948028A1 (de) * | 1998-11-20 | 2000-05-31 | Ibm | Verfahren und System zum Optimieren des Anforderungsschickens in Workflow Management Systemen |
US8249962B1 (en) | 1999-09-07 | 2012-08-21 | Garland Temple Stephens | Method and system for determining, contracting to exchange, and accounting for matched sets of offsetting cash flows |
US7130807B1 (en) | 1999-11-22 | 2006-10-31 | Accenture Llp | Technology sharing during demand and supply planning in a network-based supply chain environment |
US8032409B1 (en) | 1999-11-22 | 2011-10-04 | Accenture Global Services Limited | Enhanced visibility during installation management in a network-based supply chain environment |
US8271336B2 (en) | 1999-11-22 | 2012-09-18 | Accenture Global Services Gmbh | Increased visibility during order management in a network-based supply chain environment |
US7716077B1 (en) | 1999-11-22 | 2010-05-11 | Accenture Global Services Gmbh | Scheduling and planning maintenance and service in a network-based supply chain environment |
US20090143781A1 (en) * | 1999-12-09 | 2009-06-04 | Mische Hans A | Methods and devices for treatment of bone fractures |
JP2001233414A (ja) * | 1999-12-16 | 2001-08-28 | Hitachi Ltd | 生産計画方法 |
US6889197B2 (en) * | 2000-01-12 | 2005-05-03 | Isuppli Inc. | Supply chain architecture |
JP2004501039A (ja) * | 2000-02-29 | 2004-01-15 | ユナイテッド パーセル サービス オブ アメリカ インコーポレイテッド | 車両等の配送システムおよび方法 |
US7546255B2 (en) * | 2000-03-31 | 2009-06-09 | International Business Machines Corporation | Inventory system |
US6801901B1 (en) * | 2000-06-09 | 2004-10-05 | Penske Truck Leasing Co. | Systems and methods for building and improving the quality of inventory load configurations |
US7117130B1 (en) * | 2000-06-28 | 2006-10-03 | International Business Machines Corporation | Method for solving stochastic control problems of linear systems in high dimension |
WO2002029608A2 (en) * | 2000-10-06 | 2002-04-11 | Optiant, Inc. | System and method for determining the optimum configuration strategy for systems with multiple decision options |
US7337031B1 (en) * | 2000-10-26 | 2008-02-26 | I2 Technologies Us, Inc. | Optimized deployment of parts in a distribution network |
US7039606B2 (en) | 2001-03-23 | 2006-05-02 | Restaurant Services, Inc. | System, method and computer program product for contract consistency in a supply chain management framework |
US6954736B2 (en) | 2001-03-23 | 2005-10-11 | Restaurant Services, Inc. | System, method and computer program product for order confirmation in a supply chain management framework |
US7171379B2 (en) | 2001-03-23 | 2007-01-30 | Restaurant Services, Inc. | System, method and computer program product for normalizing data in a supply chain management framework |
US7072843B2 (en) | 2001-03-23 | 2006-07-04 | Restaurant Services, Inc. | System, method and computer program product for error checking in a supply chain management framework |
US7120596B2 (en) | 2001-03-23 | 2006-10-10 | Restaurant Services, Inc. | System, method and computer program product for landed cost reporting in a supply chain management framework |
US7292989B2 (en) * | 2001-03-23 | 2007-11-06 | Ford Motor Company | Method and system for managing carrier operations |
US7672862B1 (en) * | 2001-04-02 | 2010-03-02 | I2 Technologies Us, Inc. | Generating a supply chain plan |
US9729639B2 (en) * | 2001-08-10 | 2017-08-08 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US7797062B2 (en) * | 2001-08-10 | 2010-09-14 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US20090204237A1 (en) * | 2001-08-10 | 2009-08-13 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US8914300B2 (en) * | 2001-08-10 | 2014-12-16 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US8417360B2 (en) * | 2001-08-10 | 2013-04-09 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US20090210081A1 (en) * | 2001-08-10 | 2009-08-20 | Rockwell Automation Technologies, Inc. | System and method for dynamic multi-objective optimization of machine selection, integration and utilization |
US20030069782A1 (en) * | 2001-10-05 | 2003-04-10 | Spar Group, Inc. | System and method for scheduling and tracking retail store resets and remodels |
US7222786B2 (en) * | 2001-11-14 | 2007-05-29 | Sap Ag | Inventory early warning agent with correction by error correlation calculation |
US7398232B2 (en) * | 2001-11-14 | 2008-07-08 | Sap Aktiengesellschaft | Inventory early warning agent in a supply chain management system |
US7085837B2 (en) * | 2001-12-04 | 2006-08-01 | International Business Machines Corporation | Dynamic resource allocation using known future benefits |
US20030163364A1 (en) * | 2002-02-28 | 2003-08-28 | Piercy Lee W. | Net delta change in inventory management |
US9569746B2 (en) * | 2002-03-14 | 2017-02-14 | Nike, Inc. | Custom fit sale of footwear |
AU2003299018A1 (en) * | 2002-09-18 | 2004-04-08 | Mitsui Bussan Logistics, Inc. | System and method for distribution chain management |
US20040260703A1 (en) * | 2003-06-20 | 2004-12-23 | Elkins Debra A. | Quantitative property loss risk model and decision analysis framework |
US8407096B2 (en) * | 2003-12-24 | 2013-03-26 | Ziti Technologies Limited Liability Company | Method for ordering groups of products |
US8065172B2 (en) * | 2003-12-24 | 2011-11-22 | Ziti Technologies Limited Liability Company | Method of sourcing orders for optimized logistics |
US8260691B2 (en) * | 2004-04-21 | 2012-09-04 | Heath Juan X | Method for determining optimal inventory lot sizes |
US7840449B2 (en) * | 2004-09-07 | 2010-11-23 | International Business Machines Corporation | Total inventory management |
US20060241990A1 (en) * | 2005-04-25 | 2006-10-26 | Oracle International Corporation | Transportation planning with multi-level pooling model |
US20070050229A1 (en) * | 2005-08-17 | 2007-03-01 | Edward Tatro | Methods and systems for providing access to decision critical information for food services supply chain management |
JP4785491B2 (ja) * | 2005-10-19 | 2011-10-05 | 富士通株式会社 | 供給計画管理方法および供給計画管理プログラム |
US7904352B2 (en) * | 2006-02-17 | 2011-03-08 | Xerox Corporation | Method and system for managing material movement and inventory |
US8321354B2 (en) * | 2006-06-23 | 2012-11-27 | Jda Software Group, Inc. | System, computer-implemented method, and software for vessel scheduling for product distribution |
US7840431B2 (en) * | 2006-06-28 | 2010-11-23 | International Business Machines Corporation | Optimal group of service compositions |
US20080071592A1 (en) * | 2006-09-20 | 2008-03-20 | Day William B | Supply chain management system |
US20080082346A1 (en) * | 2006-09-29 | 2008-04-03 | Hoopes John M | System and method for automated processing of returns |
US7896244B2 (en) | 2006-12-15 | 2011-03-01 | Ziti Technologies Limited Liability Company | System and method for managing a collection of stock replenishment systems |
US20080177587A1 (en) * | 2007-01-23 | 2008-07-24 | Sonia Jean Cushing | Prioritizing orders using business factors |
JP4909869B2 (ja) * | 2007-10-17 | 2012-04-04 | 住友林業株式会社 | 部材割付システム |
US20090264225A1 (en) * | 2008-04-17 | 2009-10-22 | Lee William B | Golf tee |
US8812338B2 (en) * | 2008-04-29 | 2014-08-19 | Sas Institute Inc. | Computer-implemented systems and methods for pack optimization |
EP2316099A4 (de) * | 2008-07-11 | 2013-08-28 | Narayana Srinivasa Prasanna Gorur | Computerimplementiertes entscheidungshilfeverfahren und system |
US20100100407A1 (en) * | 2008-10-17 | 2010-04-22 | Yahoo! Inc. | Scaling optimization of allocation of online advertisement inventory |
US20100100414A1 (en) * | 2008-10-17 | 2010-04-22 | Yahoo! Inc. | Optimization of allocation of online advertisement inventory |
US20100106556A1 (en) * | 2008-10-23 | 2010-04-29 | Yahoo! Inc. | Time-weighted and scaling optimization of allocation of online advertisement inventory |
US8428985B1 (en) * | 2009-09-04 | 2013-04-23 | Ford Motor Company | Multi-feature product inventory management and allocation system and method |
WO2011150131A1 (en) * | 2010-05-26 | 2011-12-01 | Amazon Technologies, Inc. | System and method for process management in a materials handling facility |
US8515835B2 (en) * | 2010-08-30 | 2013-08-20 | Sas Institute Inc. | Systems and methods for multi-echelon inventory planning with lateral transshipment |
WO2012032331A1 (en) * | 2010-09-07 | 2012-03-15 | Bae Systems Plc | Assigning resources to resource-utilising entities |
US8688497B2 (en) | 2011-01-10 | 2014-04-01 | Sas Institute Inc. | Systems and methods for determining pack allocations |
US8788315B2 (en) | 2011-01-10 | 2014-07-22 | Sas Institute Inc. | Systems and methods for determining pack allocations |
US20160283953A1 (en) * | 2015-03-26 | 2016-09-29 | International Business Machines Corporation | Demand-supply matching with a time and virtual space network |
EP3410363A1 (de) * | 2017-05-31 | 2018-12-05 | Siemens Aktiengesellschaft | Bestimmen eines produktionsplans |
DE102020203716A1 (de) * | 2020-03-23 | 2021-09-23 | Zf Friedrichshafen Ag | Computerimplementiertes Verfahren für eine Produktionsplanung und/oder -steuerung eines Produktionssystems und Produktionsplanung und/oder-steuerungssystem |
EP3958078A1 (de) * | 2020-08-19 | 2022-02-23 | Siemens Aktiengesellschaft | Verfahren und steuereinheit zum bereitstellen von transportdaten zum steuern eines warentransports in einer produktionsumgebung sowie produktionsumgebung |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5712985A (en) * | 1989-09-12 | 1998-01-27 | Lee; Michael D. | System and method for estimating business demand based on business influences |
JP3247274B2 (ja) | 1995-02-28 | 2002-01-15 | 松下電器産業株式会社 | 輸送経路探索装置 |
US5819232A (en) | 1996-03-22 | 1998-10-06 | E. I. Du Pont De Nemours And Company | Method and apparatus for inventory control of a manufacturing or distribution process |
DE19612652C1 (de) * | 1996-04-02 | 1997-03-06 | Privatbrauerei Und Mineralbrun | Verfahren und Vorrichtung zur automatischen Steuerung des Lagerbestandes und der Verteilung von Waren |
-
1998
- 1998-12-03 US US09/204,772 patent/US6341266B1/en not_active Expired - Lifetime
-
1999
- 1999-06-18 IL IL13985099A patent/IL139850A/xx not_active IP Right Cessation
- 1999-06-18 EP EP99936457A patent/EP1088283A1/de not_active Withdrawn
- 1999-06-18 JP JP2000556322A patent/JP2002519265A/ja active Pending
- 1999-06-18 WO PCT/EP1999/004229 patent/WO1999067729A1/de active IP Right Grant
- 1999-06-18 CA CA002332995A patent/CA2332995A1/en not_active Abandoned
- 1999-06-18 AU AU51551/99A patent/AU764495B2/en not_active Ceased
Also Published As
Publication number | Publication date |
---|---|
JP2002519265A (ja) | 2002-07-02 |
WO1999067729A1 (de) | 1999-12-29 |
IL139850A (en) | 2005-11-20 |
AU764495B2 (en) | 2003-08-21 |
AU5155199A (en) | 2000-01-10 |
IL139850A0 (en) | 2002-02-10 |
EP1088283A1 (de) | 2001-04-04 |
US6341266B1 (en) | 2002-01-22 |
CA2332995A1 (en) | 1999-12-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO1999067729A9 (de) | Verfahren und system zur maximierung des bereichs von abdeckungsprofilen bei der bestandsverwaltung | |
US7528715B2 (en) | Method for optimal multi-vehicle dispatch and system for the same | |
Eskigun et al. | Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers | |
DE102004023266A1 (de) | Bestimmen eines Sollbestands für einen Knoten einer Lieferkette | |
WO2011048079A1 (de) | Passagierbewegungsvorhersage- und optimierungssystem | |
Pan et al. | Inventory models with fixed and variable lead time crash costs considerations | |
DE4429469A1 (de) | Verfahren zur Leitwegsteuerung | |
WO2022214468A1 (de) | Computerimplementiertes verfahren und computerprogramm zur montagestückzahlplanung von montageteilen für eine produktionsoptimierung eines produktionssystems, montagestückzahlplanungssystem und produktionsplanung und-steuerungssystem | |
Kuyumcu et al. | A polyhedral graph theory approach to revenue management in the airline industry | |
EP2417501A1 (de) | Lastabhängiges routing in materialflusssystemen | |
DE10311947A1 (de) | Nachfrageplanung unter Verwendung von Austauschbilanzen | |
Faghih-Mohammadi et al. | Cross-dock facility for disaster relief operations | |
DE102017212334A1 (de) | Transportsystem und verfahren zur zuordnung von frequenzen von transitservices darin | |
Smith | Optimal workload allocation in closed queueing networks with state dependent queues | |
JPH01231200A (ja) | 配車計画方法 | |
Wu et al. | A demand-shifting feasibility algorithm for Benders decomposition | |
DE102004051589A1 (de) | Planung nach dem Pull-Prinzip (verbrauchsgesteuert) für unbrauchbare Teile in Verbindung mit Reparaturplanung "on demand" (auf Nachfrage) | |
DE102019127632A1 (de) | Verfahren und vorrichtung zum einstellbaren routing mehrerer fahrzeuge | |
Saragih et al. | Single-tier city logistics model for single product | |
Heil | A solution approach for railway crew scheduling with attendance rates for multiple networks | |
EP1067444B1 (de) | Verfahren und Anordnung zur Modellierung eines technischen Systems | |
DE112020005805T5 (de) | Planung von Verteilungsanforderungen mit angemessener Verteilung | |
Li et al. | A logic-based Benders decomposition approach to improve coordination of inland vessels for inter-terminal transport | |
Gdowska et al. | A random search algorithm for cyclic delivery synchronization problem | |
Cloonan | THE TOUR PROBLEM--ANALYTIC APPROACHES TO MANAGEMENT OF THE INDUSTRIAL SALES TERRITORY |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
AK | Designated states |
Kind code of ref document: C2 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: C2 Designated state(s): GH GM KE LS MW SD SL SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
COP | Corrected version of pamphlet |
Free format text: PAGES 47 AND 48, DESCRIPTION, ADDED; ORIGINAL PAGE 47 RENUMBERED AS PAGE 49; PAGES 48-51, CLAIMS, RENUMBERED AS PAGES 50-53 |
|
ENP | Entry into the national phase |
Ref document number: 2332995 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 139850 Country of ref document: IL |
|
WWE | Wipo information: entry into national phase |
Ref document number: 51551/99 Country of ref document: AU |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1999936457 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1999936457 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
NENP | Non-entry into the national phase |
Ref country code: CA |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1999936457 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 51551/99 Country of ref document: AU |