DocumentCode
1651484
Title
Notice of Retraction
Supply chain scheduling with deadlines
Author
Lei Wang ; Guoqing Wang
Author_Institution
Dept. of Bus. Adm., Jinan Univ., Guangzhou, China
Volume
2
fYear
2010
Firstpage
662
Lastpage
665
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
This paper considers a make-to-order production-distribution system with one supplier and multiple customers. A set of orders with deadlines needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of three cases of the problem by providing efficient algorithms.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
This paper considers a make-to-order production-distribution system with one supplier and multiple customers. A set of orders with deadlines needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of three cases of the problem by providing efficient algorithms.
Keywords
batch processing (industrial); costing; customer services; goods distribution; scheduling; supply chains; batch production; deadline constraint; delivery shipment; distribution cost; make-to-order production-distribution system; multiple customers; order processing; supplier; supply chain scheduling; dynamic programming; scheduling; supply chain;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Management Science (ICAMS), 2010 IEEE International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6931-4
Type
conf
DOI
10.1109/ICAMS.2010.5553008
Filename
5553008
Link To Document