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 |
Similar Items
-
Genetic algorithm for solving job-shop scheduling problem /
by: Nuryasmin Wahida Hamil, et al.
Published: (2010) -
Solving job shop scheduling problem by using tabu search method /
by: Nur Fatihah Haron, 1988-, et al.
Published: (2012) -
Tabu search method for solving multiobjective job shop scheduling problem /
by: Nor Fauzana Awang, 1989-, author 648881, et al.
Published: (2015) -
Solving job shop scheduling problem using genetic algorithm method /
by: Farah Hana Mohd Hanafi , 1997-, author, et al.
Published: (2020) -
Solving job shop scheduling problem using the method of simulated annealing
by: Ramdzan, Nur Amira
Published: (2012)