Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1840
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Li, CL | - |
dc.creator | Ou, J | - |
dc.date.accessioned | 2014-12-11T08:25:33Z | - |
dc.date.available | 2014-12-11T08:25:33Z | - |
dc.identifier.issn | 0740-817X | - |
dc.identifier.uri | http://hdl.handle.net/10397/1840 | - |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.rights | © 2007 “IIE”. | en_US |
dc.rights | 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. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Deliveries | en_US |
dc.subject | Coordination | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Worst-case analysis | en_US |
dc.title | Coordinated scheduling of customer orders with decentralized machine locations | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Department of Logistics | en_US |
dc.identifier.spage | 899 | - |
dc.identifier.epage | 909 | - |
dc.identifier.volume | 39 | - |
dc.identifier.issue | 9 | - |
dc.identifier.doi | 10.1080/07408170600972990 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IIE transactions, Sept. 2007, v. 39, no. 9, p. 899-909 | - |
dcterms.isPartOf | IIE transactions | - |
dcterms.issued | 2007-09 | - |
dc.identifier.isi | WOS:000248147000005 | - |
dc.identifier.scopus | 2-s2.0-34447318336 | - |
dc.identifier.eissn | 1545-8830 | - |
dc.identifier.rosgroupid | r35510 | - |
dc.description.ros | 2007-2008 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
50 Final-Version.pdf | Pre-published version | 453.43 kB | Adobe PDF | View/Open |
Page views
194
Last Week
1
1
Last month
Citations as of Apr 14, 2025
Downloads
242
Citations as of Apr 14, 2025
SCOPUSTM
Citations
21
Last Week
0
0
Last month
0
0
Citations as of May 8, 2025
WEB OF SCIENCETM
Citations
20
Last Week
0
0
Last month
0
0
Citations as of May 8, 2025

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