Showing 1 - 10 of 29
We study an online scheduling problem on a single machine with delivery times. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and delivery time, become known at its arrival time. Preemption is not allowed and once the...
Persistent link: https://www.econbiz.de/10008483314
This work studies a variant of the online generalized assignment problem, where there are m⩾2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any...
Persistent link: https://www.econbiz.de/10011052489
We study in this paper multi-product facility location problem in a two-stage supply chain in which plants have production limitation, potential depots have limited storage capacity and customer demands must be satisfied by plants via depots. In the paper, handling cost for batch process in...
Persistent link: https://www.econbiz.de/10011097810
Direct shipping strategy is an easy-to-implement distribution strategy frequently used in industrial distribution systems. In this paper, an analytic method is developed for performance evaluation of the strategy for the infinite horizon inventory routing problem with delivery frequency...
Persistent link: https://www.econbiz.de/10008483350
Vendor managed inventory (VMI) is an inventory management strategy to let a vendor manage his retailers' inventories, which makes the vendor have the opportunity to obtain some inventory and market-related information of his retailers. This paper discusses how the vendor can take advantage of...
Persistent link: https://www.econbiz.de/10005236839
This paper studies an inventory routing problem (IRP) with split delivery and vehicle fleet size constraint. Due to the complexity of the IRP, it is very difficult to develop an exact algorithm that can solve large scale problems in a reasonable computation time. As an alternative, an...
Persistent link: https://www.econbiz.de/10005347610
Persistent link: https://www.econbiz.de/10005152089
Persistent link: https://www.econbiz.de/10005277496
In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS’s branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP,...
Persistent link: https://www.econbiz.de/10010597620
A new retail facility is to locate and its service quality is to determine where similar facilities of competitors offering the same goods are already present. The market share captured by each facility depends on its distance to customers and its quality, which is described by a probabilistic...
Persistent link: https://www.econbiz.de/10010574142