{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-2463"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-2463","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"Development of shop floor control system","abstract":"This thesis presents a scheduling algorithm for production planning, which involves the management of resources like equipment, tools, personnel, materials etc. The scheduling algorithm implements some of the principles of Just-In-Time manufacturing and hence has a combination of finite and infinite scheduling algorithms. It works with database such as MS Access, SQL server or Oracle etc. and has proven to reduce the total production time. In the case tested, the production time for an order of 750 Apron Hooks, the production time was reduced by 36 machine hours (4 days) from 224 hours to 188 hours. A test bed has been created as a container to this algorithm, and supports the editing of the schedule generated by the algorithm; The test bed also enables the drawing of shop layouts and shows the flow of material through the different machines in the layout. The test bed features process layouts, which are graphical representations of routing sheets. It can also calculate the Work In Progress at any time during the production process. Thus it helps in analyzing the production plans and in improving them.","abstract_html":"This thesis presents a scheduling algorithm for production planning, which involves the management of resources like equipment, tools, personnel, materials etc. The scheduling algorithm implements some of the principles of Just-In-Time manufacturing and hence has a combination of finite and infinite scheduling algorithms. It works with database such as MS Access, SQL server or Oracle etc. and has proven to reduce the total production time. In the case tested, the production time for an order of 750 Apron Hooks, the production time was reduced by 36 machine hours (4 days) from 224 hours to 188 hours. A test bed has been created as a container to this algorithm, and supports the editing of the schedule generated by the algorithm; The test bed also enables the drawing of shop layouts and shows the flow of material through the different machines in the layout. The test bed features process layouts, which are graphical representations of routing sheets. It can also calculate the Work In Progress at any time during the production process. Thus it helps in analyzing the production plans and in improving them.","abstract_has_math":false,"creators":["Parameswaran, Venkatraman"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mechanical Engineering","degree_department":null,"school":null,"contributors":["John Wang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002-01-01T08:00:00Z","date_published":"2002-01-01T08:00:00Z","updated_at":"2026-07-24T05:25:33Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/1464"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/1464","href":"https://oasis.library.unlv.edu/rtds/1464","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/140e-olfn","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["John Wang"]},{"key":"dc:creator","label":"Author","values":["Parameswaran, Venkatraman"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/140e-olfn","https://oasis.library.unlv.edu/rtds/1464","https://oasis.library.unlv.edu/context/rtds/article/2463/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis presents a scheduling algorithm for production planning, which involves the management of resources like equipment, tools, personnel, materials etc. The scheduling algorithm implements some of the principles of Just-In-Time manufacturing and hence has a combination of finite and infinite scheduling algorithms. It works with database such as MS Access, SQL server or Oracle etc. and has proven to reduce the total production time. In the case tested, the production time for an order of 750 Apron Hooks, the production time was reduced by 36 machine hours (4 days) from 224 hours to 188 hours. A test bed has been created as a container to this algorithm, and supports the editing of the schedule generated by the algorithm; The test bed also enables the drawing of shop layouts and shows the flow of material through the different machines in the layout. The test bed features process layouts, which are graphical representations of routing sheets. It can also calculate the Work In Progress at any time during the production process. Thus it helps in analyzing the production plans and in improving them."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["Development of shop floor control system"]}]}],"canonical_facts":{"dc:contributor":["John Wang"],"dc:creator":["Parameswaran, Venkatraman"],"dc:description.abstract":["This thesis presents a scheduling algorithm for production planning, which involves the management of resources like equipment, tools, personnel, materials etc. The scheduling algorithm implements some of the principles of Just-In-Time manufacturing and hence has a combination of finite and infinite scheduling algorithms. It works with database such as MS Access, SQL server or Oracle etc. and has proven to reduce the total production time. In the case tested, the production time for an order of 750 Apron Hooks, the production time was reduced by 36 machine hours (4 days) from 224 hours to 188 hours. A test bed has been created as a container to this algorithm, and supports the editing of the schedule generated by the algorithm; The test bed also enables the drawing of shop layouts and shows the flow of material through the different machines in the layout. The test bed features process layouts, which are graphical representations of routing sheets. It can also calculate the Work In Progress at any time during the production process. Thus it helps in analyzing the production plans and in improving them."],"dc:format":["pdf"],"dc:identifier":["10.25669/140e-olfn","https://oasis.library.unlv.edu/rtds/1464","https://oasis.library.unlv.edu/context/rtds/article/2463/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Development of shop floor control system"],"dc:type":["Text"],"thesis:degree_discipline":["Mechanical Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:25:33Z"}