Notice of RetractionNeighborhood search for minimizing tardiness objectives on flow shop of batch processing machines

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 presents the scheduling problem on flow shop with batch processing machines (BPM) to minimize maximum tardiness. An efficient neighborhood search is proposed for the problem, in which job permutation and batch permutation are optimization object and the solution of two sub-problems can be directly obtained by using the permutations. To obtain the promising results, an initial solution of neighborhood search is first produced and then two swap operations are applied to improve the solution. The proposed neighborhood search is finally tested and the computational results show its good performance on many-BPM flow shop scheduling.