Notice of RetractionA biphasic approach for university timetabling problem

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.

University Timetabling is a challenging problem has caught the eye of researchers for numerous decades due to its unavoidable significance along with NP-hard complexity. The research paper presents the approach consisted of two distinguishable phases. First one completely neutralizes the search space from hard constraints and consequently ends with a preliminary solution which feeds the successive processing step. Subsequently the second phase deals with the soft constraints initially scan throughout the layout to detect and mark the time slots with their associated penalties afterward the mechanism iteratively pushes the penalized events to the locations raised with minimum penalty cost. Key advantages of using this technique are to build an efficient deployment and maximum utilization of the resources.