東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms for Two-Stage Flow-shop w...

Yang, Yang.

FindBook

Google Book

Amazon

博客來

Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two./
作者:	Yang, Yang.
面頁冊數:	95 p.
附註:	Source: Masters Abstracts International, Volume: 51-05.
Contained By:	Masters Abstracts International51-05(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR91799
ISBN:	9780494917992

Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two.
Yang, Yang.

Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two. - 95 p.

Source: Masters Abstracts International, Volume: 51-05.

Thesis (M.Sc.)--Universite du Quebec a Chicoutimi (Canada), 2013.

Scheduling problems may be encountered in many situations in everyday life. Organizing daily activities and planning a travel itinerary are both examples of small optimization problems that we try to solve every day without realizing it. However, when these problems take on larger instances, their resolution becomes a difficult task to handle due to prohibitive computations that generated.

ISBN: 9780494917992Subjects--Topical Terms:

626642
Computer Science.

Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two.
LDR:03110nam 2200337 4500 001 1957606
005 20140106101312.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9780494917992
035 $a (UMI)AAIMR91799
035 $a AAIMR91799
040 $a UMI $c UMI
100 1 $a Yang, Yang. $3 1030201
245 1 0 $a Algorithms for Two-Stage Flow-shop with a shared machine in stage one and two parallel machines in stage two.
300 $a 95 p.
500 $a Source: Masters Abstracts International, Volume: 51-05.
500 $a Adviser: Djamal Rebain.
502 $a Thesis (M.Sc.)--Universite du Quebec a Chicoutimi (Canada), 2013.
520 $a Scheduling problems may be encountered in many situations in everyday life. Organizing daily activities and planning a travel itinerary are both examples of small optimization problems that we try to solve every day without realizing it. However, when these problems take on larger instances, their resolution becomes a difficult task to handle due to prohibitive computations that generated.
520 $a This dissertation deals with the Two-Stage Flow-shop problem that consists of three machines and in which we have two sets of jobs. The first set has to be processed, in this order, by machine M1 and then by machine M2. Whereas, the second set of jobs has to be processed, in this order, by machine M 1 and then by machine M3. As we can see, machine M1 is a shared machine, and the other two machines are dedicated to each of the two subsets of jobs.
520 $a This problem is known to be strongly NP-Hard. This means there is a little hope that it can be solved by an exact method in polynomial time. So, special cases, heuristic, and meta-heuristic methods are well justified for its resolution.
520 $a We thus started in this thesis to present special cases of the considered problem and showed their resolution in polynomial time.
520 $a In the approximation front, we solved the considered problem with heuristic and meta-heuristic algorithms.
520 $a In the former approach, we designed two heuristic algorithms. The first one is based on Johnson's rule, whereas the second one is based on Nawez, Enscore, and Ham algorithm. The experimental study we have undertaken shows that the efficiency and the quality of the solutions produced by these two heuristic algorithms are high.
520 $a In the latter approach, we designed a Particle Swarm Optimization algorithm. This method is known to be popular because of its easy implementation. However, this algorithm has many natural shortcomings. We thus combined it with the tabu search algorithm to compensate the negative effects. The experimental study shows that the new hybrid algorithm outperforms by far not only the standard Particle Swarm Optimization, but also the tabu search method we also designed for this problem.
590 $a School code: 0862.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Universite du Quebec a Chicoutimi (Canada). $3 1032071
773 0 $t Masters Abstracts International $g 51-05(E).
790 1 0 $a Rebain, Djamal, $e advisor
790 $a 0862
791 $a M.Sc.
792 $a 2013
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR91799