Notice of RetractionEfficient sub-optimal earliest deadline with local search job shop scheduling algorithm

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.

Minimizing the turnaround time for job orders on the manufacturing shop floor can raise the utilization and efficiencies of the resources in an organization. In some cases, it can reduce capital expenditure for more machines whilst handling the same amount of work load. The key is to schedule the individual processes in the job order to reduce slack time whilst adhering to the process ordering constraints of each job order. Using an algorithm to schedule processes with the earliest deadline is a simple and quick way to create a sub-optimal job shop schedule. However this gives rise to gaps in the machine utilization, which can be exploited to further reduce the overall turnaround time. This paper presents an additional step through the local search mechanism which does not cost much more computationally to the overall algorithm.