Mobile QR Code QR CODE : The Transactions of the Korean Institute of Electrical Engineers

References

1 
R. Ruiz, J. A. V Rodriguez, 2010, The hybrid flow shop scheduling problem, European journal of operational research, Vol. 205, No. 1, pp. 1-18DOI
2 
S. M. Johnson, 1954, Optimal two‐and three‐stage production schedules with setup times included, Naval research logistics quarterly, Vol. 1, No. 1, pp. 61-68DOI
3 
T. Kis, E. Pesch, 2005, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, European Journal of Operational Research, Vol. 164, No. 3, pp. 592-608DOI
4 
M. S. Nagano, H. H. Miyata, 2016, "Review and classification of constructive heuristics mechanisms for no-wait flow shop problem, The International Journal of Advanced Manufacturing Technology, Vol. 86, No. 5, pp. 2161-2174DOI
5 
D. Arora, G. Agarwal, 2016, Meta-heuristic approaches for flowshop scheduling problems: a review, International Journal of Advanced Operations Management, Vol. 8, No. 1, pp. 1-16Google Search
6 
P. E. T. E. R. Stefan, 2003, Flow-shop scheduling based on reinforcement learning algorithm, Production Systems and Information Engineering, Vol. 1, No. 1, pp. 83-90Google Search
7 
R. S. Sutton, A. G. Barto, 1998, Introduction to reinforcement learning (Vol. 135), Cambridge: MIT pressGoogle Search
8 
H. Hasselt, 2010, Double Q-learning. Advances in neural information processing systems, 23, pp. 2613-2621Google Search
9 
Z. Wang, T. Schaul, M. Hessel, H. Hasselt, M. Lanctot, N. Freitas, June 2016, Dueling network architectures for deep reinforcement learning, In International conference on machine learning (pp. 1995-2003). PMLRGoogle Search
10 
J. M. Framinan, R. Leisten, R. Ruiz-Usano, 2002, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research, Vol. 141, No. 3, pp. 559-569DOI
11 
M. Nawaz, E. E. Enscore Jr, I. Ham, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, Vol. 11, No. 1, pp. 91-95Google Search
12 
M. Ancău, 2012, On solving flowshop scheduling problems. Proceedings of the Romanian Academy, Series A, Vol. 13, No. 1, pp. 71-79Google Search
13 
T Yamada, 2003, Studies on metaheuristics for jobshop and flowshop scheduling problemsGoogle Search
14 
L. Wang, L. Zhang, D. Z Zheng, 2006, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Computers & Operations Research, Vol. 33, No. 10, pp. 2960-2971DOI
15 
T. K. Varadharajan, C. Rajendran, 2005, A multi- objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, European Journal of Operational Research, Vol. 167, No. 3, pp. 772-795DOI
16 
M. Akhshabi, J. Khalatbari, 2011, Solving flexible job-shop scheduling problem using clonal selection algorithm, Indian Journal of Science & Technology, Vol. 4, No. 10, pp. 1248-1251Google Search
17 
C Low, 2005, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Computers & Operations Research, Vol. 32, No. 8, pp. 2013-2025DOI
18 
I. A. Chaudhry, A. M Khan, 2012, Minimizing makespan for a no-wait flowshop using genetic algorithm, Sadhana, Vol. 37, No. 6, pp. 695-707DOI
19 
Y. Fonseca, Y. Martinez, A. E. Figueredo, L. A. Pernia, 2014, Behavior of the main parameters of the Genetic Algorithm for Flow Shop Scheduling Problems, Revista Cubana de Ciencias Informaticas, Vol. 8, No. 1, pp. 99-111Google Search
20 
C. R. A Reeves, 1995, genetic algorithm for flowshop sequencing, Computers & operations research, Vol. 22, No. 1, pp. 5-13DOI
21 
A. Sadegheih, 2006, Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance, Applied Mathematical Modelling, Vol. 30, No. 2, pp. 147-154DOI
22 
Y. Zhang, X. Li, Q. Wang, 2009, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, European Journal of Operational Research, Vol. 196, No. 3, pp. 869-876DOI
23 
P. E. T. E. R. Stefan, 2003, Flow-shop scheduling based on reinforcement learning algorithm, Production Systems and Information Engineering, Vol. 1, No. 1, pp. 83-90Google Search
24 
Y. C. Fonseca-Reyna, Y. Martinez-Jimenez, A. Nowe, 2018, Q-learning algorithm performance for m-machine, n-jobs flow shop scheduling problems to minimize makespan, Investigacion Operacional, Vol. 38, No. 3, pp. 281-290Google Search
25 
Z. Zhang, W. Wang, S. Zhong, K. Hu, 2013, Flow shop scheduling with reinforcement learning, Asia-Pacific Journal of Operational Research, 1350014, Vol. 30DOI
26 
E Taillard, 1993, Benchmarks for basic scheduling problems, european journal of operational research, Vol. 64, No. 2, pp. 278-285DOI
27 
J. H. Lee, H. J. Kim, 2021, Reinforcement learning for robotic flow shop scheduling with processing time variations, International Journal of Production Research, pp. 1-23DOI
28 
J Carlier, 1978, Ordonnancements a contraintes disjonctives, RAIRO- Operations Research, Vol. 12, No. 4, pp. 333-350Google Search
29 
A Reeves C. R, 1995, genetic algorithm for flowshop sequencing, Computers & operations research, Vol. 22, No. 1, pp. 5-13DOI
30 
Y. Liu, M. Yin, W. Gu, 2014, An effective differential evolution algorithm for permutation flow shop scheduling problem. Applied Mathematics and Computation, 248, pp. 143-159DOI
31 
X. Li, M. Yin, 2014, An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure, Advances in Engineering Software, Vol. 55, pp. 10-31DOI
32 
Q. Luo, Y. Zhou, J. Xie, M. Ma, L. Li, 2014, Discrete bat algorithm for optimal problem of permutation flow shop scheduling, The Scientific World JournalDOI
33 
Q. Lin, L. Gao, X. Li, C. Zhang, 2015, A hybrid backtracking search algorithm for permutation flow-shop scheduling problem, Computers & Industrial Engineering, Vol. 85, pp. 437-446DOI
34 
M. F. Tasgetiren, Y. C. Liang, M. Sevkli, G. Gencyilmaz, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European journal of operational research, Vol. 177, No. 3, pp. 1930-1947DOI
35 
B. Liu, L. Wang, Y. H. Jin, 2007, An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), Vol. 37, No. 1, pp. 18-27DOI
36 
Z. Xie, C. Zhang, X. Shao, W. Lin, H. Zhu, 2014, An effective hybrid teaching–learning-based optimization algorithm for permutation flow shop scheduling problem, Advances in Engineering Software, Vol. 77, pp. 35-47DOI
37 
T. Zheng, M. Yamashiro, 2010, Solving flow shop scheduling problems by quantum differential evolutionary algorithm, The International Journal of Advanced Manufacturing Technology, Vol. 49, No. 5, pp. 643-662DOI
38 
L. Y. Tseng, Y. T. Lin, 2010, A hybrid genetic algorithm for no-wait flowshop scheduling problem, International journal of production economics, Vol. 128, No. 1, pp. 144-152DOI
39 
O. Tosun, M. K. Marichelvam, 2016, Hybrid bat algorithm for flow shop scheduling problems, International Journal of Mathematics in Operational Research, Vol. 9, No. 1, pp. 125-138Google Search
40 
X. Li, M. Yin, 2013, A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem, International Journal of Production Research, Vol. 51, No. 16, pp. 4732-4754DOI
41 
M. Abdel-Basset, G. Manogaran, D. El-Shahat, S. Mirjalili, 2018, A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem, Future Generation Computer Systems, Vol. 85, pp. 129-145DOI
42 
G. I. Zobolas, C. D. Tarantilis, G. Ioannou, 2009, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Computers & Operations Research, Vol. 36, No. 4, pp. 1249-1267DOI
43 
L. Y. Tseng, Y. T. Lin, 2010, A hybrid genetic algorithm for no-wait flowshop scheduling problem, International journal of production economics, Vol. 128, No. 1, pp. 144-152DOI
44 
J. Y. Ding, S. Song, J. N. Gupta, R. Zhang, R. Chiong, C Wu, 2015, An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem, Applied Soft Computing, Vol. 30, pp. 604-613DOI
45 
D. Davendra, M. Bialic-Davendra, 2013, Scheduling flow shops with blocking using a discrete self-organising migrating algorithm, International Journal of Production Research, Vol. 51, No. 8, pp. 2200-2218DOI
46 
M. F. Tasgetiren, D. Kizilay, Q. K. Pan, P. N. Suganthan, 2017, Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, Computers & Operations Research, Vol. 77, pp. 111-126DOI
47 
F. Zhao, H. Liu, Y. Zhang, W. Ma, C. Zhang, 2018, A discrete water wave optimization algorithm for no-wait flow shop scheduling problem, Expert Systems with Applications, Vol. 91, pp. 347-363DOI
48 
Q. K. Pan, L. Wang, B. H. Zhao, 2008, An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion, The International Journal of Advanced Manufacturing Technology, Vol. 38, No. 7, pp. 778-786DOI