A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties

@article{Banisadr2013AHI,
  title={A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties},
  author={Afsheen Banisadr and Mostafa Zandieh and Iraj Mahdavi},
  journal={The International Journal of Advanced Manufacturing Technology},
  year={2013},
  volume={65},
  pages={981-989}
}
In this paper, we study single-machine scheduling problem when each job is considered with linear earliness and quadratic tardiness penalties with no machine idle time. Here the objective is to find the best sequence of jobs in the reasonable time. This model was studied in several researches, and some algorithms were proposed to solve it such as genetic algorithm. As the size of problem increased, such algorithms were not effective and efficient. Hence, we proposed the hybrid imperialist… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Common Due-Date Problem: Linear Algorithm for a Given Job Sequence

  • 2014 IEEE 17th International Conference on Computational Science and Engineering
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…