The Library

Logistics scheduling with batching and transportation

Tools

Chen, Bo, Dr. and Lee, Chung-Yee. (2008) Logistics scheduling with batching and transportation. European Journal of Operational Research, Vol.189 (No.3). pp. 871-876. ISSN 0377-2217

Full text not available from this repository.

Abstract

This paper studies a general two-stage scheduling problem, in which jobs of different importance are processed by one first-stage processor and then, in the second stage, the completed jobs need to be batch delivered to various pre-specified destinations in one of a number of available transportation modes. Our objective is to minimize the sum of weighted job delivery time and total transportation cost. Since this problem involves not only the traditional performance measurement, such as weighted completion time, but also transportation arrangement and cost, key factors in logistics management, we thus call this problem logistics scheduling with hatching and transportation (LSBT) problem.

We draw an overall picture of the problem complexity for various cases of problem parameters accompanied by polynomial algorithms for solvable cases. On the other hand, we provide for the most general case an approximation algorithm of performance guarantee. (C) 2007 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
H Social Sciences > HF Commerce
Divisions: Faculty of Social Sciences > Warwick Business School
Library of Congress Subject Headings (LCSH): Industrial management, Business logistics, Shipment of goods -- Mathematical models, Delivery of goods, Economic lot size
Journal or Publication Title: European Journal of Operational Research
Publisher: Elsevier Science BV
ISSN: 0377-2217
Official Date: 16 September 2008
Volume: Vol.189
Number: No.3
Number of Pages: 6
Page Range: pp. 871-876
Identification Number: 10.1016/j.ejor.2006.11.047
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Research Grants Council (Hong Kong, China) (RGC)
Grant number: HKUST 6010/02E (RGC)
Version or Related Resource: Paper presented at: 3rd Biannual Conference on Operational Research Peripatetic, Valencia, Spain, Sept. 06-10, 2005
Conference Paper Type: Paper
Type of Event: Conference
References:

[1] S. Albers, P. Brucker, The complexity of one-machine
batching problems, Discrete Applied Mathematics 47
(1993) 107–877.
[2] J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz, Scheduling
Computer and Manufacturing Processes, second ed.,
Springer-Verlag, Berlin, 2001.
[3] P. Brucker, Scheduling Algorithms, third ed., Springer-
Verlag, Berlin, 2001.
[4] Z.-L. Chen, Scheduling and common due date assignment
with earliness–tardiness penalties and batch delivery costs,
European Journal of Operational Research 93 (1996) 49–60.
[5] Z.-L. Chen, G.L. Vairaktarakis, Integrated scheduling of
production and distribution operations, Management Science
51 (2005) 614–628.
[6] T.C.E. Cheng, V.S. Gordon, M.Y. Kovalyov, Single
machine scheduling with batch deliveries, European Journal
of Operational Research 94 (1996) 277–283.
[7] N.G. Hall, M.A. Lesaoana, C.N. Potts, Scheduling with
fixed delivery dates, Operations Research 49 (2001) 134–144.
[8] N.G. Hall, C.N. Potts, Supply chain scheduling: batching
and delivery, Operations Research 51 (2003) 566–584.
[9] J. Herrmann, C.-Y. Lee, On scheduling to minimize
earliness–tardiness and batch delivery costs with a common
due date, European Journal of Operational Research 70
(1993) 272–288.
[10] C.-Y. Lee, Z.-L. Chen, Machine scheduling with transportation
considerations, Journal of Scheduling 4 (2001) 3–24.
[11] C.-L. Li, G. Vairaktarakis, C.-Y. Lee, Machine scheduling
with deliveries to multiple customer locations, European
Journal of Operational Research 164 (2005) 39–51.
[12] H. Matsuo, The weighted total tardiness problem with fixed
shipping times and overtime utilization, Operations Research
36 (1988) 293–307.
[13] C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization:
Algorithms and Complexity, Dover Publications, 1998.
[14] M. Pinedo, Scheduling: Theory, Algorithms, and Systems,
second ed., Prentice Hall, Englewood Cliffs, New Jersey,
2002.
[15] A. Soukhal, A. Oulamara, P. Martineau, Complexity of flow
shop scheduling problems with transportation constraints,
European Journal of Operational Research 161 (2005) 32–
41.
[16] H. Wang, C.-Y. Lee, Two-stage logistics scheduling with
two-mode transportation, To appear in Naval Research
Logistics.
URI: http://wrap.warwick.ac.uk/id/eprint/30159

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Actions (login required)

View Item View Item