Title :
Notice of Retraction
Rescheduling to minimize the total completion time under a limit on the total completion time of the original jobs
Author :
Yundong Mu ; Yun Hao
Author_Institution :
Coll. of Sci., Henan Univ. of Technol., Zhengzhou, China
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 consider the rescheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion time of its jobs only. In this paper, we consider the two agents rescheduling problem for jobs on a single machine to minimize total completion time under a limit on the total completion time of the original jobs. We show that the considered problems can be solved in polynomial time or pseudopolynomial time.
Keywords :
job shop scheduling; polynomials; single machine scheduling; nonpreemptive jobs; polynomial time; pseudopolynomial time; rescheduling problems; single machine; total completion time; Artificial neural networks; Indexing; disruption; multiagent; objective function; rescheduling; total completion time;
Conference_Titel :
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5537-9
DOI :
10.1109/ICCSIT.2010.5564767
