Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32999
Title: Optimal scheduling of a single-supplier single-manufacturer supply chain with common due windows
Authors: Yeung, WK
Choi, TM 
Cheng, TCE 
Keywords: NP-hardness
operations research
optimal control
scheduling
Issue Date: 2010
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on automatic control, 2010, v. 55, no. 12, 5460987, p. 2767-2777 How to cite?
Journal: IEEE transactions on automatic control 
Abstract: We study a supply chain scheduling control problem involving a single supplier, a single manufacturer and multiple retailers, where the manufacturer with limited production capacity can only take some of the orders of the retailers. The manufacturer aims to maximize its profit, which is a function of the storage time, storage quantity, order sequence dependent weighted storage costs, and idle time of the orders to be accepted. We formulate the problem as a two-machine common due windows proportionate flow shop scheduling problem. We show that the problem is NP-hard. We provide the first pseudo-polynomial algorithm to optimally solve the problem. We show that for an accepted set of orders the shortest processing time earliest permutation schedule yields an optimal schedule. We prove that we can reduce the latest due dates of the due windows, which are given parameters, for minimizing the computational effort. We establish a tight upper bound on the enumeration process to manage the order idle time. We eliminate the need for generating all the optimal partial schedules to obtain an optimal solution, thus reducing the running time of our algorithm for solving the problem. We computationally tested the algorithm and the results show that the algorithm can solve large-sized problems very efficiently.
URI: http://hdl.handle.net/10397/32999
ISSN: 0018-9286
EISSN: 1558-2523
DOI: 10.1109/TAC.2010.2049766
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

31
Last Week
1
Last month
0
Citations as of Sep 8, 2017

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
Citations as of Sep 14, 2017

Page view(s)

63
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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