KnowledgeWorks@UBalt accepts scholarly material created by students, staff, and faculty members of the University of Baltimore community. Graduate students are required to submit their finished thesis or dissertation, while staff and faculty can upload completed academic work to enhance their global visibility on the web. A wide variety of scholarly materials are accepted in any file format.
(Elsevier, 2018-01-03) Ahmadi, Ehsan; Suer, Gursel; Goldengorin, Boris; Mosadegh, Hadi; Information System and Decision Sciences; Information System and Decision Sciences
One of the well-known problems in a single machine scheduling context is the Job Sequencing and Tool Switching Problem (SSP). The SSP is optimally sequencing a finite set of jobs and loading a restricted subset of tools to a magazine with the aim of minimizing the total number of tool switches. It has been proved in the literature that the SSP can be reduced to the Job Sequencing Problem (JSeP). In the JSeP, the number of tool switches from the currently processed job to the next job depends on the sequencing of all predecessors. In this paper, the JSeP is modeled as a Traveling Salesman Problem of Second Order(2-TSP).