Flow- Shop scheduling Problem to Minimize Total Weighted Late Work

Authors

  • Al Zuwaini M. K. Thi-qar University,Collage of Mathematics and Computer science
  • Abdul Razaq T. S. University of Al Mustansiriyah,College of Science/Math. Dep.
  • Al Saidy S. K. University of Al Mustansiriyah,College of Science/Math. Dep.

Keywords:

Flow-shop, Late work, Schedule.

Abstract

       In this paper we considered a flow-shop scheduling problem to minimize the total weighed late work. Branch and bound method was suggested to obtain an optimal solution. Several local search methods: descent method, simulated annealing, threshold accepting, genetic algorithm and hybrid method were used to obtain near optimal solutions, and comparison the results.

Downloads

Download data is not yet available.

Downloads

Published

2017-08-29

How to Cite

M. K., A. Z., T. S., A. R., & S. K., A. S. (2017). Flow- Shop scheduling Problem to Minimize Total Weighted Late Work. Journal of Al-Qadisiyah for Computer Science and Mathematics, 1(1), 147–160. Retrieved from https://jqcsm.qu.edu.iq/index.php/journalcm/article/view/179

Issue

Vol. 1 No. 1 (2009): JQCM

Section

Math Articles