東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Scheduling optimization of manufactu...

Samarghandi, Hamed.

FindBook

Google Book

Amazon

博客來

Scheduling optimization of manufacturing systems with no-wait constraints.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Scheduling optimization of manufacturing systems with no-wait constraints./
作者:	Samarghandi, Hamed.
面頁冊數:	189 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-07(E), Section: B.
Contained By:	Dissertation Abstracts International75-07B(E).
標題:	Plastics Technology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NS28057
ISBN:	9780499280572

Scheduling optimization of manufacturing systems with no-wait constraints.
Samarghandi, Hamed.

Scheduling optimization of manufacturing systems with no-wait constraints. - 189 p.

Source: Dissertation Abstracts International, Volume: 75-07(E), Section: B.

Thesis (Ph.D.)--University of Manitoba (Canada), 2013.

No-wait scheduling problem refers to the set of problems in which a number of jobs are available for processing on a number of machines with the added constraint that there should be no waiting time between consecutive operations of the jobs. It is well-known that most of the no-wait scheduling problems are strongly NP-hard. Moreover, no-wait scheduling problems have numerous real-life applications. This thesis studies a wide range of no-wait scheduling problems, along with side constraints that make such problems more applicable. First, 2-machine no-wait flow shop problem is studied. Afterwards, setup times and single server constraints are added to this problem in order to make it more applicable. Then, job shop version of this problem is further researched. Analytical results for both of these problems are presented; moreover, efficient algorithms are developed and applied to large instances of these problems.

ISBN: 9780499280572Subjects--Topical Terms:

1023683
Plastics Technology.

Scheduling optimization of manufacturing systems with no-wait constraints.
LDR:03094nam a2200325 4500 001 1966295
005 20141106122648.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9780499280572
035 $a (MiAaPQ)AAINS28057
035 $a AAINS28057
040 $a MiAaPQ $c MiAaPQ
100 1 $a Samarghandi, Hamed. $3 2103110
245 1 0 $a Scheduling optimization of manufacturing systems with no-wait constraints.
300 $a 189 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-07(E), Section: B.
500 $a Adviser: Tarek ElMekkawy.
502 $a Thesis (Ph.D.)--University of Manitoba (Canada), 2013.
520 $a No-wait scheduling problem refers to the set of problems in which a number of jobs are available for processing on a number of machines with the added constraint that there should be no waiting time between consecutive operations of the jobs. It is well-known that most of the no-wait scheduling problems are strongly NP-hard. Moreover, no-wait scheduling problems have numerous real-life applications. This thesis studies a wide range of no-wait scheduling problems, along with side constraints that make such problems more applicable. First, 2-machine no-wait flow shop problem is studied. Afterwards, setup times and single server constraints are added to this problem in order to make it more applicable. Then, job shop version of this problem is further researched. Analytical results for both of these problems are presented; moreover, efficient algorithms are developed and applied to large instances of these problems.
520 $a Afterward, general no-wait flow shop problem (NWFS) is the focus of the thesis. First, the NWFS is studied; mathematical models as well as metaheuristics are developed for NWFS. Then, setup times are added to NWFS in order to make the problem more applicable. Finally, the case of sequence dependent setup times is further researched. Efficient algorithms are developed for both problems.
520 $a Finally, no-wait job shop (NWJS) problem is studied. Literature has proposed different methods to solve NWJS; the most successful approaches decompose the problem into a timetabling sub-problem and a sequencing sub-problem. Different sequencing and timetabling algorithms are developed to solve NWJS.
520 $a This thesis provides insight to several no-wait scheduling problems. A number of theorems are discussed and proved in order to find the optimum solution of no-wait problems with special characteristics. For the problems without such characteristics, mathematical models are developed. Metaheuristics are utilized to deal with large-instances of NP-hard problems. Computational results show that the developed methods in this thesis are very effective and efficient compared to the competitive methods available in the literature.
590 $a School code: 0303.
650 4 $a Plastics Technology. $3 1023683
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Engineering, Mechanical. $3 783786
690 $a 0795
690 $a 0546
690 $a 0548
710 2 $a University of Manitoba (Canada). $b Mechanical and Manufacturing Engineering. $3 2102491
773 0 $t Dissertation Abstracts International $g 75-07B(E).
790 $a 0303
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NS28057