{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/80220"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/80220","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Application of two complementary sequencing rules to control the job shop by switching","abstract":"This research presents two switching techniques using SOT and SLACK, as complementary sequencing rules, to show that they are practical procedures to control a job shop. These two approaches are: Static switching of the complementary rules. Dynamic switching of the complementary rules. This study also presents questions which arise in creating different switching rules or procedures for an interactive scheduling system. It is also developed a normalized objective function to measure the balance of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a typical scheduling procedure. Finally, a procedure to calculate the upper and lower limits is presented for dynamic switching procedures.","abstract_html":"This research presents two switching techniques using SOT and SLACK, as complementary sequencing rules, to show that they are practical procedures to control a job shop. These two approaches are: Static switching of the complementary rules. Dynamic switching of the complementary rules. This study also presents questions which arise in creating different switching rules or procedures for an interactive scheduling system. It is also developed a normalized objective function to measure the balance of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a typical scheduling procedure. Finally, a procedure to calculate the upper and lower limits is presented for dynamic switching procedures.","abstract_has_math":false,"creators":["Tellez, Ruben B."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1982,"date_issued":"1982","date_published":"1982","updated_at":"2026-07-22T22:20:08Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/80220","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["Tellez, Ruben B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-11-09T21:31:46Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-11-09T21:31:46Z"]},{"key":"dc:date.issued","label":"Date","values":["1982"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/80220"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This research presents two switching techniques using SOT and SLACK, as complementary sequencing rules, to show that they are practical procedures to control a job shop. These two approaches are: Static switching of the complementary rules. Dynamic switching of the complementary rules. This study also presents questions which arise in creating different switching rules or procedures for an interactive scheduling system. It is also developed a normalized objective function to measure the balance of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a typical scheduling procedure. Finally, a procedure to calculate the upper and lower limits is presented for dynamic switching procedures."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Application of two complementary sequencing rules to control the job shop by switching"]}]}],"canonical_facts":{"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["Tellez, Ruben B."],"dc:date.accessioned":["2017-11-09T21:31:46Z"],"dc:date.available":["2017-11-09T21:31:46Z"],"dc:date.issued":["1982"],"dc:description.abstract":["This research presents two switching techniques using SOT and SLACK, as complementary sequencing rules, to show that they are practical procedures to control a job shop. These two approaches are: Static switching of the complementary rules. Dynamic switching of the complementary rules. This study also presents questions which arise in creating different switching rules or procedures for an interactive scheduling system. It is also developed a normalized objective function to measure the balance of the best properties produced by SOT (low flow time) and SLACK (low tardiness). It should be noted that even though such a system could be viewed as complex and expensive,it is not. Computational requirement will be slightly increased, but no more data is required than is expected for a typical scheduling procedure. Finally, a procedure to calculate the upper and lower limits is presented for dynamic switching procedures."],"dc:description.degree":["Master of Science"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/80220"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Application of two complementary sequencing rules to control the job shop by switching"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:20:08Z"}