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

@article{Lee2010NoticeOR,
  title={Notice of RetractionEfficient sub-optimal earliest deadline with local search job shop scheduling algorithm},
  author={C. C. Anthony Lee and Ian K. T. Tan},
  journal={2010 IEEE International Conference on Advanced Management Science(ICAMS 2010)},
  year={2010},
  volume={2},
  pages={484-488}
}
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… CONTINUE READING