Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families

@article{Venkataramana2010AntCA,
  title={Ant colony-based algorithms for scheduling parallel batch processors with incompatible job families},
  author={M. Venkataramana and N. R. Srinivasa Raghavan},
  journal={IJMOR},
  year={2010},
  volume={2},
  pages={73-98}
}
In current dynamic business environments, meeting the customer due dates and avoiding delay penalties are very important. Our work concerns with the static scheduling of jobs to parallel identical batch processors for minimising the total weighted tardiness. It is assumed that the jobs are incompatible in respect of job families indicating that jobs from different families cannot be processed together. In practice, the problem cannot be solved using any classical OR algorithms in polynomial… CONTINUE READING
5 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Ant Colony Optimization. New Delhi, India: Prentice-Hall of India Pvt

  • M. Dorigo, T. Stützle
  • 2005
Highly Influential
5 Excerpts

A pseudo polynomial algorithm for sequencing jobs to minimize total tardiness

  • E. L. Lawler
  • Annals of Discrete Mathematics,
  • 1977
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…