DocumentCode
1648378
Title
Notice of Retraction
Integrated production and delivery scheduling problem with two competing agents
Author
Jing Fan
Author_Institution
Sch. of Sci., East China Univ. of Sci. & Technol., Shanghai, China
Volume
2
fYear
2010
Firstpage
157
Lastpage
160
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.
In the supply chain management, besides the coordination job scheduling and finished goods delivery decision maker need consider the balance between the agents(customers) competing for a common processing resource. In the case of two agents, competing to perform their respective nonpreemptive jobs on a single machine in the plant, this paper considers the objective to minimize the total job arrival times, i.e., the sum of time between job´s release and delivery to the corresponding agent, in the constrained optimization form. After investigating the properties of the optimal solution, we show the complexity of the problem, and present the dynamic programming algorithm.
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.
In the supply chain management, besides the coordination job scheduling and finished goods delivery decision maker need consider the balance between the agents(customers) competing for a common processing resource. In the case of two agents, competing to perform their respective nonpreemptive jobs on a single machine in the plant, this paper considers the objective to minimize the total job arrival times, i.e., the sum of time between job´s release and delivery to the corresponding agent, in the constrained optimization form. After investigating the properties of the optimal solution, we show the complexity of the problem, and present the dynamic programming algorithm.
Keywords
dynamic programming; goods distribution; job shop scheduling; supply chain management; delivery scheduling problem; dynamic programming algorithm; goods delivery decision maker; job scheduling; supply chain management; Integrated circuits; Production; Competing agents; Dynamic programming; Integrated production and distribution; Supply chain scheduling;
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.5552895
Filename
5552895
Link To Document