A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem
| dc.contributor.author | Ahmadi, Ehsan | |
| dc.contributor.author | Suer, Gursel | |
| dc.contributor.author | Goldengorin, Boris | |
| dc.contributor.author | Mosadegh, Hadi | |
| dc.contributor.department | Information System and Decision Sciences | en |
| dc.contributor.program | Information System and Decision Sciences | en |
| dc.date.accessioned | 2021-01-07T13:54:52Z | |
| dc.date.available | 2021-01-07T13:54:52Z | |
| dc.date.issued | 2018-01-03 | |
| dc.description.abstract | 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). | en |
| dc.description.uri | https://www.researchgate.net/profile/Boris_Goldengorin/publication/322228276_A_hybrid_method_of_2-TSP_and_novel_learning-based_GA_for_job_sequencing_and_tool_switching_problem/links/5ab3bdffa6fdcc1bc0c35053/A-hybrid-method-of-2-TSP-and-novel-learning-based-GA-for-job-sequencing-and-tool-switching-problem.pdf | en |
| dc.format.extent | 214-229 pp | en |
| dc.genre | journal article | en |
| dc.identifier | doi:10.13016/m2biuy-uexn | |
| dc.identifier.citation | Ahmadi, E., Goldengorin, B., Süer, G. A., & Mosadegh, H. (2018). A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Applied Soft Computing, 65, 214-229. DOI: 10.1016/j.asoc.2017.12.04 | en |
| dc.identifier.uri | DOI: 10.1016/j.asoc.2017.12.04 | |
| dc.identifier.uri | https://www.researchgate.net/profile/Boris_Goldengorin/publication/322228276_A_hybrid_method_of_2-TSP_and_novel_learning-based_GA_for_job_sequencing_and_tool_switching_problem/links/5ab3bdffa6fdcc1bc0c35053/A-hybrid-method-of-2-TSP-and-novel-learning-based-GA-for-job-sequencing-and-tool-switching-problem.pdf | |
| dc.identifier.uri | http://hdl.handle.net/11603/20352 | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.isAvailableAt | University of Baltimore | |
| dc.rights | Public Domain Mark 1.0 | * |
| dc.rights.uri | http://creativecommons.org/publicdomain/mark/1.0/ | * |
| dc.subject | Combinatorial optimization | en |
| dc.subject | Job Scheduling | en |
| dc.subject | Tool switches | en |
| dc.subject | Genetic algorithm | en |
| dc.subject | Q-learning | en |
| dc.subject | Reinforcement learning | en |
| dc.title | A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem | en |
| dc.type | Text | en |