國立虎尾科技大學 |

Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines./
作者:	Screnock, Joshua.
面頁冊數:	1 online resource (85 pages)
附註:	Source: Masters Abstracts International, Volume: 56-05.
Contained By:	Masters Abstracts International56-05(E).
標題:	Industrial engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9781369886269

Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines.
Screnock, Joshua.

Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines. - 1 online resource (85 pages)

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

Thesis (M.S.)

Includes bibliographical references

This research considers the scheduling problem where a set of jobs must be grouped into batches and then scheduled on batch processing machines in a two-stage flowshop. The jobs must be scheduled in such a way that the number of tardy jobs (jobs completed after their due date) is minimized. Each job has a different size, and both machines can hold multiple jobs, up to a fixed capacity. This problem has not received any attention in the literature until this point.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781369886269Subjects--Topical Terms:

679492
Industrial engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines.
LDR:02919ntm a2200361Ki 4500 001 911194
005 20180529081858.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9781369886269
035 $a (MiAaPQ)AAI10266211
035 $a (MiAaPQ)niu:12832
035 $a AAI10266211
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Screnock, Joshua. $3 1182875
245 1 0 $a Using GRASP to Minimize the Number of Tardy Jobs in a Two-Stage Flowshop With Batch Processing Machines.
264 0 $c 2017
300 $a 1 online resource (85 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 56-05.
500 $a Adviser: Purushothaman Damodaran.
502 $a Thesis (M.S.) $c Northern Illinois University $d 2017.
504 $a Includes bibliographical references
520 $a This research considers the scheduling problem where a set of jobs must be grouped into batches and then scheduled on batch processing machines in a two-stage flowshop. The jobs must be scheduled in such a way that the number of tardy jobs (jobs completed after their due date) is minimized. Each job has a different size, and both machines can hold multiple jobs, up to a fixed capacity. This problem has not received any attention in the literature until this point.
520 $a The Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is proposed to solve this problem. A set of 240 data sets is generated using various numbers of jobs, processing times, job sizes, and machine capacities. Each of the data sets is solved using GRASP, and the results are compared to the solutions generated from solving the same data sets using a Mixed-Integer Linear Programming (MILP) model, which is solved in IBM's ILOG CPLEX software. The solutions from GRASP are compared to the solutions from CPLEX in order to determine the effectiveness of the GRASP algorithm.
520 $a After comparing the GRASP solutions to the solutions from CPLEX, it is clear that GRASP outperforms CPLEX on large data sets (instances with 100 or more jobs). In smaller data sets, GRASP will sometimes generate equal or better solutions than CPLEX, but sometimes will generate worse solutions. It appears that the quality of the GRASP solution is affected by the sizes of the jobs in the batch and the machine capacity, but more study is needed to verify this. In all data sets with more than 10 jobs, GRASP provides significant time savings over CPLEX.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Northern Illinois University. $b Industrial and Systems Engineering. $3 1182876
773 0 $t Masters Abstracts International $g 56-05(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10266211 $z click for full text (PQDT)