Notice of RetractionA note on single-machine rescheduling problems with learning effect under disruptions

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.

Rescheduling problem means that a set of original jobs has already been scheduled to minimize some classical objective, then the decision maker needs to insert some new jobs into the existing schedule and creates a disruption. In this paper, we consider single-machine rescheduling problem with position-dependent learning effect under disruption, which learning effect means that the processing time of a job reflects a decreasing as a function of the number of repetitions. The objective is to minimize makepan, the total completion time and maximum lateness under a limit of the disruption from the original scheduling, and to minimize the total of the cost with original cost measure and disruption, respectively. We show that the considered problem can be solved in polynomial time.