DocumentCode
1965607
Title
Notice of Retraction
Transportation scheduling with limited waiting time constraints before a single batching machine
Author
Hua Gong ; Daheng Chen
Author_Institution
Coll. of Sci., Shenyang Ligong Univ., Shenyang, China
Volume
2
fYear
2010
fDate
10-11 July 2010
Firstpage
172
Lastpage
175
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.
We develop a single batching machine model that incorporates transportation before processing with job waiting time constraint. In this model, there are some vehicles with unit capacity that travel between the machine and the holding area, and the waiting time of each job before processing can not be greater than a given upper bound. The batching machine has a capacity limit and incurs a processing cost. The objective is to minimize the sum of the total completion time and the total processing cost. We analyze the optimal properties and prove that the problem is NP-hard. We also provide a pseudo- polynomial time algorithm to solve the problem and prove that it is ordinarily NP-hard. Our work has implications for the coordination of production scheduling and transportation to improve ideal overall system performance in logistics and operations management, especially to reduce fuel consumption in the system with limited time constraint.
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.
We develop a single batching machine model that incorporates transportation before processing with job waiting time constraint. In this model, there are some vehicles with unit capacity that travel between the machine and the holding area, and the waiting time of each job before processing can not be greater than a given upper bound. The batching machine has a capacity limit and incurs a processing cost. The objective is to minimize the sum of the total completion time and the total processing cost. We analyze the optimal properties and prove that the problem is NP-hard. We also provide a pseudo- polynomial time algorithm to solve the problem and prove that it is ordinarily NP-hard. Our work has implications for the coordination of production scheduling and transportation to improve ideal overall system performance in logistics and operations management, especially to reduce fuel consumption in the system with limited time constraint.
Keywords
job shop scheduling; logistics; minimisation; polynomials; single machine scheduling; transportation; NP-hard problem; fuel consumption; job waiting time constraint; limited waiting time constraint; logistics; operations management; production scheduling; pseudopolynomial time algorithm; single batching machine; transportation scheduling; Production; Silicon; Strontium; Vehicles; batching machine; complexity; transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial and Information Systems (IIS), 2010 2nd International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-7860-6
Type
conf
DOI
10.1109/INDUSIS.2010.5565651
Filename
5565651
Link To Document