1 |
Gupta, J.N.D., Flowshop Schedules With Sequence Dependent Setup TIMES, Journal of the Operations Research Society of Japan, 1986, Vol. 29, No. 3, pp. 206-219.
DOI
|
2 |
Laporte, G., The traveling salesman problem: An overview of exact and approximate algorithms, European Journal of Operational Research, 1992, Vol. 59, No. 2, pp. 231-247.
DOI
|
3 |
Nadesri, B., Ghomi, S.M.T.F., Aminnayeri, M., A high performing metaheuristic for job shop scheduling with sequence-dependent setup times, Applied Soft Computing, 2010, Vol. 10, No. 3, pp. 703-710.
DOI
|
4 |
Vela, C.R., Varela, R., Gonzalez, M.A., Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, Journal of Heuristics, 2010, Vol. 16, No. 1, pp. 139-165.
DOI
|
5 |
Yoo, W.S., Seo, J.H., Lee, D.H., Kim, D.H., Kim, K.H., Scheduling Generation Model on Parallel Machines with Due Date and Setup Cost Based on Deep Learning, The Journal of Society for e-Business Studies, Vol. 24, No. 3, pp. 99-110.
|
6 |
Bellman, R., Dynamic Programming Treatment of the Travelling Salesman Problem, Journal of the ACM, 1962, Vol. 9, No. 1, pp. 61-63.
DOI
|
7 |
Lin, S., Kernighan, B.W., An effective heuristic algorithm for the traveling-salesman problem, Operations Research, 1973, Vol. 21, No. 2, pp. 498-516.
DOI
|
8 |
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by Simulated Annealing, Science, 1983, Vol. 220, No.4598, pp. 671-680.
DOI
|
9 |
Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M., An analysis of several heuristics for the traveling salesman problem, SIAM Journal on Computing, 1977, Vol. 6, No. 3, pp. 563-581.
DOI
|
10 |
Artigues, C., Feillet, D., A branch and bound method for the job-shop problem with sequence-dependent setup times, Annals of Operations Research, 2008, Vol. 159, No. 1, pp. 135-159.
DOI
|
11 |
Glover, F., Tabu Search - Part II ORSA, Journal on Computing, 1990, Vol. 2, No. 1, pp. 4-32.
|
12 |
Yoo, W.S., Kim, S.J., Kim, K.H., Real-Time Scheduling Scheme based on Reinforcement Learning Considering Minimizing Setup Cost, The Journal of Society for e-Business Studies, Vol. 25, No. 2, pp. 15-27.
|
13 |
Yu, S.Y., Scheduling of Production Process with Setup Cost depending Job Sequence, Management & Information Systems Review, 2015, Vol. 34, No.2, pp. 67-78.
DOI
|
14 |
WIKIPEDIA, https://en.wikipedia.org/wiki/2-opt.
|
15 |
Garfinkel, R.S., Technical Note-On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem, Operations Research, 1973, Vol. 21, No. 1, pp. 340-343.
DOI
|
16 |
Glover, F., Tabu Search - Part I ORSA, Journal on Computing, 1989, Vol. 1, No. 3, pp. 190-206.
|
17 |
Shin, H.J., Kim, S.S., Ko, K.S., A Tabu Search Algorithm for Single Machine Scheduling Problem with Job Release Times and Sequence-dependent Setup Times, Journal of the Korean Institute of Industrial Engineers, 2001, Vol. 27, No. 2, pp. 158-168.
|
18 |
Lee, J.Y., Jeong, B.J., Heuristic Algorithms for a Two-Machine Flowshop Scheduling Problem with Urgent Jobs and Sequence-Dependent Setup Times, Korean Management Science Review, 2020, Vol. 37, No. 1, pp. 47-60.
DOI
|
19 |
Joo, C.M., An Improved Ant Colony System for Parallel-Machine Scheduling Problem with Job Release Times and Sequence-Dependent Setup Times, Journal of the Korean Institute of Industrial Engineers, 2009, Vol. 35, No. 4, pp. 218-225.
|