Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Logistics scheduling with batching and transportation

Tools
- Tools
+ Tools

Chen, Bo and Lee, Chung-Yee (2008) Logistics scheduling with batching and transportation. European Journal of Operational Research, Vol.189 (No.3). pp. 871-876. doi:10.1016/j.ejor.2006.11.047

Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.ejor.2006.11.047

Request Changes to record.

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
Dates:
DateEvent
16 September 2008Published
Volume: Vol.189
Number: No.3
Number of Pages: 6
Page Range: pp. 871-876
DOI: 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

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us