Please use this identifier to cite or link to this item:
|Title:||Coordinated scheduling of customer orders with decentralized machine locations|
|Publisher:||Taylor & Francis|
|Source:||IIE Transactions, Sept. 2007, v. 39, no. 9, p. 899-909.|
|Abstract:||We consider a scheduling model with two machines at different locations. Each job is composed of two tasks where each task must be processed by a specific machine. The finished tasks are shipped to a distribution center in batches before they are bundled together and delivered to customers. The objective is to minimize the sum of the delivery cost and customers' waiting costs. This model attempts to coordinate the production and delivery schedules on the decentralized machines while taking into consideration the shipping cost as well as the waiting time of the customers. We develop polynomial-time heuristic algorithms for this problem and analyze their worst-case performance. Computational experiments are conducted to test the effectiveness of the heuristics and to evaluate the benefits obtained by coordinating the production and delivery of the two decentralized machines.|
|Rights:||© 2007 “IIE”.|
This is an electronic version of an article published in C.-L. Li and J. Ou (2007), IIE Transactions, 39(9), 899-909. IIE Transactions is available online at: http://www.informaworld.com, the open URL of the article: http://www.informaworld.com/openurl?genre=article&issn=0740-817X&volume=39&issue=9&spage=899.
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|50 Final-Version.pdf||Pre-published version||453.43 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.