Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18252
Title: Single Supplier Scheduling for Multiple Deliveries
Authors: Cheng, TCE 
Kovalyov, MY
Keywords: Batching
Delivery
Scheduling
Supply chain
Issue Date: 2001
Publisher: Springer
Source: Annals of operations research, 2001, v. 107, no. 1-4, p. 51-63 How to cite?
Journal: Annals of operations research 
Abstract: The problem of scheduling the production and delivery of a supplier to feed the production of F manufacturers is studied. The orders fulfilled by the supplier are delivered to the manufacturers in batches of the same size. The supplier's production line has to be set up whenever it switches from processing an order of one manufacturer to an order of another manufacturer. The objective is to minimize the total setup cost, subject to maintaining continuous production for all manufacturers. The problem is proved to be NP-hard. It is reduced to a single machine scheduling problem with deadlines and jobs belonging to F part types. An O(N log F) algorithm, where N is the number of delivery batches, is presented to find a feasible schedule. A dynamic programming algorithm with O(NF/FF-2) running time is presented to find an optimal schedule. If F = 2 and setup costs are unit, an O(N) time algorithm is derived.
URI: http://hdl.handle.net/10397/18252
ISSN: 0254-5330
EISSN: 1572-9338
DOI: 10.1023/A:1014938712999
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Sep 24, 2017

WEB OF SCIENCETM
Citations

21
Last Week
0
Last month
0
Citations as of Sep 22, 2017

Page view(s)

61
Last Week
1
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.