When should we dispatch trucks with unreliable transit times?

Date

1996-06-25

Author

Erkip, N
Yano, CA

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

83
views

0
downloads

We consider a situation where each of several customers has deterministic demands, in each of several periods in the future, for a single bulk good. The supplier ships this good using trucks, with each truck carrying a full load. Transit times are affected by weather, the conditions of the roads, and other non-controllable factors. We study the problem of how many trucks to dispatch to a given customer in each time period with the goal of minimizing the total expected cost of procurement, inventory holding costs, and shortage costs. The possibility of salvaging excess inventory is also considered. We analyze a few simple models to develop an understanding of the properties of the optimal solution.

URI

https://hdl.handle.net/11511/64431

Collections

Department of Industrial Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs Alp, O; Erkip, NK; Gullu, R (Institute for Operations Research and the Management Sciences (INFORMS), 2003-01-01) We characterize optimal policies of a dynamic lot-sizing/vehicle-dispatching problem under dynamic deterministic demands and stochastic lead times. An essential feature of the problem is the structure of the ordering cost, where a fixed cost is incurred every time a batch is initiated (or a vehicle is hired) regardless of the portion of the batch (or vehicle) utilized. Moreover, for every unit of demand not satisfied on time, holding and backorder costs are incurred. Under mild assumptions we show that the ...
Repetition support and mining cyclic patterns Toroslu, İsmail Hakkı (Elsevier BV, 2003-10-01) For customer transaction database, the support (customer support) of the sequential pattern is defined as the fraction of the customers supporting the sequence. We define new forms of the mining patterns, called cyclic patterns, as an extension to the sequential pattern mining by introducing a new parameter, the repetition support. For customer transaction database, the repetition support specifies the minimum number of repetitions of the patterns in each customer transaction sequence. Repeated patterns can...
Scheduling a batch processing machine with non-identical job sizes Azizoğlu, Meral (2000-07-10) The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with arbitrary job processing times, job weights and job sizes. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to similar to 25 jobs in reasonable C...
Comparison of Fine Grained and Coarse Grained Parallel Models in Particle Swarm Optimization Algorithm Baştürk, Alper; Akay, Rüştü; Kalınlı, Adem (2011-11-23) Many optimization problems are generally complex and required to be solved in parallel architectures due to theircomputational costs. The main issue about the parallelism is that the parallel architectures may affect the performancebecause the original models are constructed based upon the sequential architectures. Therefore, the parallelizationapproaches should consider the efficiency in addition to reducing computational cost. The objective of this paper is two-fold.First goal is presenting a parallelizat...
Multi-objective regression test selection in practice: An empirical study in the defense software industry Garousi, Vahid; Özkan, Ramazan; Betin Can, Aysu (2018-11-01) Context: Executing an entire regression test-suite after every code change is often costly in large software projects. To cope with this challenge, researchers have proposed various regression test-selection techniques.

Citation Formats

N. Erkip and C. Yano, “When should we dispatch trucks with unreliable transit times?,” 1996, p. 341, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64431.