A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Discrete warehouse problem
1995
Theoretical Computer Science
Preserved Fulltext
In this paper, we consider motion planning problems in a discrete warehouse with movable obstacles. ...
A discrete warehouse is a collection of two-dimensional unit-square objects (robot and obstacles), which are allowed to move horizontally and vertically along grid lines. ...
Discussion and open problems In this paper we have introduced a new class of motion planning problems, called the discrete warehouse problem, for a robot on a two-dimensional grid in the presence of movable ...
doi:10.1016/0304-3975(94)00192-l
fatcat:jzvx355m6vbx5kir7aav5sifmu
Convex hull results for the warehouse problem
2018
Discrete Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Given an initial stock and a capacitated warehouse, the warehouse problem aims to decide when to sell and purchase to maximize profit. This problem is common in revenue management and energy storage. ...
We extend this problem by incorporating fixed costs and provide convex hull descriptions as well as tight compact extended formulations for several variants. ...
Introduction The warehouse problem, introduced by Cahn [1] , is to optimally decide on purchasing (or production), storage and sales quantities for a product with a fixed warehouse capacity and a given ...
doi:10.1016/j.disopt.2018.06.002
fatcat:6eccbzifhvge7f5aubefpvyboe
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
2009
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present an optimal polynomial time algorithm for the discrete problem. ...
We call this the EOQ-Max problem and the D-EOQ-Max problem, if the product is continuously divisible and discrete, respectively. ...
The problem D-EOQ-Max differs from the earlier studied EOQ problems by the assumptions that the product is discrete, the warehouse capacity is a decision variable, and the warehouse cost dominates the ...
doi:10.1016/j.dam.2009.01.004
fatcat:epqswfzej5axnefbmm45uefozu
Non-switching reaching law based discrete time quasi-sliding mode control with application to warehouse management problem
2014
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper a new non-switching type reaching law for sliding mode control of discrete time systems is introduced and applied to the problem of periodic review inventory management. ...
The warehouse stock level is shown in Fig. 4 . ...
CONCLUSIONS In this paper we have presented a novel reaching law for discrete time sliding mode control systems. ...
doi:10.3182/20140824-6-za-1003.00181
fatcat:5oooen6qlzeypfw4ixweayba3m
A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
[chapter]
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We consider a well-known NP-hard deterministic inventory control problem: the One-Warehouse Multi-Retailer (OWMR) problem. ...
We then show how this algorithm can be improved to a 2-approximation by halving the demands at the warehouse and at the retailers in the subproblems. ...
Only few papers propose algorithms or heuristics to solve the OWMR problem in its discrete-time version. ...
doi:10.1137/1.9781611973082.6
dblp:conf/soda/StaufferMRG11
fatcat:ubzzpyiqnfghlcrf6slj3ca6de
A Three Echelon Supply System: A Discrete Event Simulation
2013
2013 International Conference on Communication Systems and Network Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the important tools is discrete simulation1 model. ...
Also, regarding other states such as opening warehouses for some of plants and designing a three echelon supply chain will be performed. ...
To implement the new scenario, the main problem breaks into two similar problems. Problem 1 is delivering the products to warehouses from corporation, considering no shortage. ...
doi:10.1109/csnt.2013.182
fatcat:rg5fnsw4pncjdmvjbwh5zrhbb4
Picking Routing Problem with K homogenous material handling equipment for a refrigerated warehouse
2016
Revista Facultad de Ingeniería
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper aims at formulating a Picking Routing Problem with K homogenous material handling equipment for a refrigerated warehouse (PRPHE). ...
The discrete PSO is a novel approach to solving cold routing picking problems, which has not been detected in the scientific literature and is considered a contribution to the state of the art. ...
Problem description and formulation
Problem description A refrigerated warehouse with 1000 metres of floor area is represented for our picking routing problem. ...
doi:10.17533/udea.redin.n80a02
fatcat:npwdyhheuzanzphepr2pdbei5u
Simulation Optimization of Discrete Logistics Processes: A Case Study on Logistics of an E-Commerce Enterprise in Shanghai
2019
Discrete Dynamics in Nature and Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Thus, this paper sets a framework to solve the above problem. ...
Then the AnyLogic software is used to simulate and optimize the system from three aspects, including routes selection, warehouses quantity, and warehouses layout. ...
This paper considers adding one warehouse, that is, double warehouses mode to solve this problem.
Simulation Comparison of Double Warehouses Mode and Single Warehouse Mode. ...
doi:10.1155/2019/2493638
fatcat:wqltso7xtfaubilrlfscpn7n6m
Introducing Logistics
[chapter]
2013
Introduction to Logistics Systems Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
128
3.3.2 Single-commodity single-echelon discrete location
problems
132
3.3.3 Single-commodity two-echelon discrete location
problems
155
3.3.4 The multicommodity case
159
3.3.5 Location-covering ...
, 4
5 Managing a warehouse
210
5.1 Introduction
210
5.1.1 Performance parameters
213
5.1.2 Decision-making problems J
216
5.2 Warehouse design
216
5.2.1 Choice of warehouse systems
217
5.2.2 ...
doi:10.1002/9781118492185.ch1
fatcat:yf32hahbvra4hgt6ex5t7h2oz4
Optimization of Processes in a Freight Forwarding Company Using a Simulation Model
2017
MATEC Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Software SIMUL8 was chosen as a development environment for its possibility of dynamic discrete simulation of company processes. ...
Optimization is focused on the company's warehouse, where a sequence of vehicles loading and unloading operations and emerging downtime are explored. ...
The problem was related to the downtime of vehicles in the warehouse. ...
doi:10.1051/matecconf/201713400050
fatcat:ybyn5vyte5arln4je6w36pgvba
A Discrete Particle Swarm Optimization to Solve the Put-away Routing Problem in Distribution Centres
2020
Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, this paper aims to formulate and solve a Put-away Routing Problem (PRP) in distribution centres (DCs). ...
Put-away operations typically consist of moving products from depots to allocated storage locations using either operators or Material Handling Equipment (MHE), accounting for important operative costs in warehouses ...
of problem in the warehouse and DC. ...
doi:10.3390/computation8040099
fatcat:avsuibihzvfpddp5jchgwzokfy
Page 20 of The Journal of the Operational Research Society Vol. 54, Issue 1
[page]
2003
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Solving large scale unca- pacitated facility location problems. In: Pardalos PM (ed). Approximation and Computing in Numerical Optimization: Continuous and Discrete Problems. ...
Network and Discrete Location: Models, Algorithms, and Applications. Wiley: New York. Re Velle CS and Laporte G (1996). The plant location problem: new models and research prospects. ...
Simulated Annealing to Solve Single Stage Capacitated Warehouse Location Problem
2015
Procedia Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Warehouse Location Problem is one model of Facility Location Problem which aims to locate the set of warehouses as one of distribution facility. ...
In this study, a mathematical model of Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been developed to determine the optimal warehouse location in fertilizer distribution of PT. ...
Warehouse Location Problem with Fixed Installation Costs Location problem in this model categorized as discrete model [1] . ...
doi:10.1016/j.promfg.2015.11.015
fatcat:eftdbxogdjc35aic6suotkgfki
Capacitated Warehouse Location Problems with Economies of Scale in Operating Costs
[chapter]
1994
Operations Research Proceedings 1993
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Considering the. problem of finding a rrinimal total costs warehouse design wherein individual warehouses have limited capacity and exhibit continuous economies of scale in variable warehousing costs, ...
Though economies of scale are very common in real life production-transportation planning situations, most publications concerning nonlinear discrete location problems consider some type of convex objective ...
Considering the. problem of finding a rrinimal total costs warehouse design wherein individual warehouses have limited capacity and exhibit continuous economies of scale in variable warehousing costs, ...
doi:10.1007/978-3-642-78910-6_86
fatcat:l37oxws4dzhqtm2pcq5552lj2m
Page 327 of Management Science Vol. 5, Issue 3
[page]
1959
Management Science
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
EASTMAN
The Computation Laboratory of Harvard University
The warehouse problem requires the determination of a sequence of buy and sell decisions at discrete points in time. ...
A NOTE ON THE MULTI-COMMODITY WAREHOUSE PROBLEM*
WILLARD L. ...
« Previous
Showing results 1 — 15 out of 24,432 results