Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines

@article{Monch2008HeuristicsTM,
  title={Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines},
  author={Lars Monch},
  journal={2008 IEEE International Conference on Automation Science and Engineering},
  year={2008},
  pages={572-577}
}
  • Lars Monch
  • Published in
    IEEE International Conference on Automation…
    2008
In this paper, we present an efficient method to solve unrelated parallel machine total weighted tardiness (TWT) scheduling problems. We apply an ant colony optimization (ACO) approach as a heuristic to solve this NP-hard problem. A colony of artificial ants is used to construct iteratively solutions of the scheduling problem using artificial pheromone trails and heuristic information. For the computation of the heuristic information, we use the apparent tardiness cost (ATC) dispatching rule… CONTINUE READING

References

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

Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach

  • K.-C. Ying, S.-W. Lin
  • International Journal of Production Research,
  • 2006
1 Excerpt