國立虎尾科技大學 |

Developing a Real Time Online Scheduling System for a Manufacturing Service Company : = Achieving Visibility.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Developing a Real Time Online Scheduling System for a Manufacturing Service Company :/
Reminder of title:	Achieving Visibility.
Author:	Mahale, Sujay.
Description:	1 online resource (274 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
Contained By:	Dissertation Abstracts International79-04B(E).
Subject:	Industrial engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9780355369106

Developing a Real Time Online Scheduling System for a Manufacturing Service Company : = Achieving Visibility.
Mahale, Sujay.

Developing a Real Time Online Scheduling System for a Manufacturing Service Company :Achieving Visibility. - 1 online resource (274 pages)

Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.

Thesis (D.E.)

Includes bibliographical references

Job shop scheduling problems in general fall under a class of NP-hard problems. For a manufacturing service company operating under a job shop environment, the task of scheduling labor and jobs to the machines is extremely complicated. This can be attributed to the many factors involved in it including sequence dependent set-ups, maintenance schedules, variable processing times, uncertain demand, job due dates, flexible labor shift schedules, labor overtime, multiple parallel machines, labor dependent machine operability, and variable labor requirements.

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

Mode of access: World Wide Web

ISBN: 9780355369106Subjects--Topical Terms:

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

554714
Electronic books.

Developing a Real Time Online Scheduling System for a Manufacturing Service Company : = Achieving Visibility.
LDR:03910ntm a2200397Ki 4500 001 910956
005 20180517120325.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355369106
035 $a (MiAaPQ)AAI10617976
035 $a (MiAaPQ)lamar:11039
035 $a AAI10617976
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Mahale, Sujay. $3 1182505
245 1 0 $a Developing a Real Time Online Scheduling System for a Manufacturing Service Company : $b Achieving Visibility.
264 0 $c 2017
300 $a 1 online resource (274 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: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
500 $a Adviser: Alberto Marquez.
502 $a Thesis (D.E.) $c Lamar University - Beaumont $d 2017.
504 $a Includes bibliographical references
520 $a Job shop scheduling problems in general fall under a class of NP-hard problems. For a manufacturing service company operating under a job shop environment, the task of scheduling labor and jobs to the machines is extremely complicated. This can be attributed to the many factors involved in it including sequence dependent set-ups, maintenance schedules, variable processing times, uncertain demand, job due dates, flexible labor shift schedules, labor overtime, multiple parallel machines, labor dependent machine operability, and variable labor requirements.
520 $a In this study, a recursive routine was developed to determine a feasible job and labor schedule, aiming to minimize the cost of weighted tardiness, cost of operating machines, and cost of labor overtime. To search for a near optimal solution to the dual objective problem, two simulated annealing based algorithms were encoded in PHP. A MySQL based database was split in to training-data used to determine the algorithm parameters, and the variable demand instance test-data to run cost trials. For the purpose of achieving visibility, altering the MySQL database, and dispersing updated schedules, a dynamic web-based client-side user interface encoded using HTML5, CSS, JavaScript, JQuery, Ajax, and PHP was developed.
520 $a The results of the trial runs on the training data suggested that for the first algorithm, temperature reduction factor had a significant effect on the execution time, but not in the objective. The starting temperature, on the other hand, had no effect on either. On the contrary for the second algorithm, the temperature reduction factor and the starting temperature, had a significant effect on both the execution time and the tardiness objective. Further analysis suggested that increasing the total number of employees or multi-tasking of employees was essential to reduce the total tardiness. When the objective was altered to minimize the total cost as opposed to the total tardiness, it was observed that the tardiness weight was instrumental in reducing the total tardiness. This effect was true only upto a certain increased weight beyond which it did not affect the total tardiness. Similarly, an inverse relation was noticed between the total overtime and the total tardiness. Higher the overtime, lower the tardiness.
520 $a The concept of using problem specific information, and exploiting the dependency relation of the different elements to simplify the problem, proved an effective strategy for solving a multi-dimensional problem.
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
650 4 $a Operations research. $3 573517
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0546
690 $a 0796
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Lamar University - Beaumont. $b Industrial Engineering. $3 1182506
773 0 $t Dissertation Abstracts International $g 79-04B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10617976 $z click for full text (PQDT)