大葉大學圖書館 |

登入

回首頁

Makespan minimization in a job shop ...

Florida International University.

Makespan minimization in a job shop with a batch processing machine.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	Makespan minimization in a job shop with a batch processing machine.
作者:	Rojas Santiago, Miguel.
面頁冊數:	127 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7062.
Contained By:	Dissertation Abstracts International71-11B.
標題:	Engineering, Industrial.
標題:	Operations Research.
ISBN:	9781124299648
摘要、提要註:	A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm\|batch\|Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm\|\| Cmax), which is known to be NP-hard.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430527

Makespan minimization in a job shop with a batch processing machine.
Rojas Santiago, Miguel.

Makespan minimization in a job shop with a batch processing machine. - 127 p.

Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7062.

Thesis (Ph.D.)--Florida International University, 2010.

A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm|batch|Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm|| Cmax), which is known to be NP-hard.

ISBN: 9781124299648Subjects--Topical Terms:

423093
Engineering, Industrial.

Makespan minimization in a job shop with a batch processing machine.
LDR:03265nam 2200325 4500 001 345093
005 20110620110234.5
008 110817s2010 ||||||||||||||||| ||eng d
020 $a 9781124299648
035 $a (UMI)AAI3430527
035 $a AAI3430527
040 $a UMI $c UMI
100 1 $a Rojas Santiago, Miguel. $3 423570
245 1 0 $a Makespan minimization in a job shop with a batch processing machine.
300 $a 127 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7062.
500 $a Adviser: Purushothaman Damodaran.
502 $a Thesis (Ph.D.)--Florida International University, 2010.
520 $a A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm|batch|Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm|| Cmax), which is known to be NP-hard.
520 $a This research extends the scheduling literature by combining Jm||Cmax with batch processing. The primary contributions are the mathematical formulation, a new network representation and several solution approaches. The problem under study is observed widely in metal working and other industries, but received limited or no attention due to its complexity.
520 $a A novel network representation of the problem using disjunctive and conjunctive arcs, and a mathematical formulation are proposed to minimize the makespan. Besides that, several algorithms, like batch forming heuristics, dispatching rules, Modified Shifting Bottleneck, Tabu Search (TS) and Simulated Annealing (SA), were developed and implemented. An experimental study was conducted to evaluate the proposed heuristics, and the results were compared to those from a commercial solver (i.e., CPLEX).
520 $a TS and SA, with the combination of MWKR-FF as the initial solution, gave the best solutions among all the heuristics proposed. Their results were close to CPLEX; and for some larger instances, with total operations greater than 225, they were competitive in terms of solution quality and runtime. For some larger problem instances, CPLEX was unable to report a feasible solution even after running for several hours. Between SA and the experimental study indicated that SA produced a better average Cmax for all instances.
520 $a The solution approaches proposed will benefit practitioners to schedule a job shop (with both discrete and batch processing machines) more efficiently. The proposed solution approaches are easier to implement and requires short run times to solve large problem instances.
590 $a School code: 1023.
650 4 $a Engineering, Industrial. $3 423093
650 4 $a Operations Research. $3 423094
690 $a 0546
690 $a 0796
710 2 $a Florida International University. $3 423571
773 0 $t Dissertation Abstracts International $g 71-11B.
790 1 0 $a Damodaran, Purushothaman, $e advisor
790 $a 1023
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430527

筆 0 讀者評論

多媒體

多媒體檔案
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430527

評論

新增評論分享你的心得

Export

取書館別