Proposed method for solving the flow shop scheduling problem for n-jobs on m-machines
This research suggested a new heuristic method for solving the n-jobs, m- machines flow shop scheduling problem to minimize total completion time. This method was compared with The (NEH) method for data generated by using (matlab) and showed high efficiency and easy to use.
| Format: | Article |
|---|---|
| Language: | Arabic |
| Published: |
College of Computer Science and Mathematics, University of Mosul
2009-06-01
|
| Series: | المجلة العراقية للعلوم الاحصائية |
| Online Access: | https://stats.mosuljournals.com/article_30635_7d83802114d7cfbe432661169ed10253.pdf |