Browse > Article
http://dx.doi.org/10.22156/CS4SMB.2021.11.08.207

Minimizing the total completion time in a two-stage flexible flow shop  

Yoon, Suk-Hun (Department of Industrial and Information Systems Engineering Soongsil University)
Publication Information
Journal of Convergence for Information Technology / v.11, no.8, 2021 , pp. 207-211 More about this Journal
Abstract
This paper addresses a two-stage flexible flow shop scheduling problem in which there is one machine in stage 1 and two identical machines in stage 2. The objective is the minimization of the total completion time. The problem is formulated by a mixed integer quadratic programming (MIQP) and a hybrid simulated annealing (HSA) is proposed to solve the MIQP. The HSA adopts the exploration capabilities of a genetic algorithm and incorporates a simulated annealing to reduce the premature convergence. Extensive computational tests on randomly generated problems are carried out to evaluate the performance of the HSA.
Keywords
Scheduling; Flexible Flow Shop; Total Completion Time; Mixed Integer Quadratic Programming; Simulated Annealing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. A. Kida, A. E. L. Rivas & L. A. Gallego. (2020). An improved simulated annealing-linear programming hybrid algorithm applied to the optimal coordination of directional overcurrent relays. Electric Power Systems Research, 181. 106197. DOI : /10.1016/j.epsr.2020.106197   DOI
2 D. E. Goldberg. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Reading : Addison Wesley.
3 M. Almaraashi, R. John, A. Hopgood & S. Ahmadi (2016). Learning of interval and general type-2 fuzzy logic systems using simulated annealing: Theory and practice. Information Sciences, 360, 21-42.   DOI
4 V. Courchelle, M. Soler, D. Gonzalez-Arribas & D. Delahaye. (2019). A simulated annealing approach to 3D strategic aircraft deconfliction based on en-route speed changes under wind and temperature uncertainties. Transportation Research Part C: Emerging Technologies, 103, 194-210.   DOI
5 G. Gong, R. Chiong, Q. Deng, W. Han, L. Zhang, W. Lin & K. Li. (2020). Energy-efficient flexible flow shop scheduling with worker flexibility. Expert Systems with Applications, 141. 112902 DOI : 10.1016/j.eswa.2019.112902   DOI
6 M. L. Pinedo. (2016). Scheduling: Theory, Algorithms, and Systems (5th Ed.). New York : Springer.
7 K. R. Baker & D. Trietsch. (2019). Principles of Sequencing and Scheduling (2nd Ed.). New York : Wiley.
8 J. Ding, S. Schulz, L. Shen, U. Buscher & Z. Lu. (2021). Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Computers and Operations Research, 125. 105088 DOI : 10.1016/j.cor.2020.105088   DOI
9 A. Ernst, J. Fung, G. Singh & Y. Zinder. (2019). Flexible flow shop with dedicated buffers. Discrete Applied Mathematics, 261, 148-163.   DOI
10 H. Ahonen & A. G. de Alvarenga. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures. International Journal of Advanced Manufacturing Technology, 89, 765-777.   DOI
11 M. Gendreau & J.-Y. Potvin (eds) (2018). Handbook of Metaheuristics (3rd Ed.). New York : Springer.
12 M. T. Assadi & M. Bagher. (2016). Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems. Computers & Industrial Engineering, 96, 149-161.   DOI
13 A. M. Fathollahi-Fard, K. Govindan, M. Hajiaghaei-Keshteli & A. Ahmadi. (2019). A green home health care supply chain: New modified simulated annealing algorithms. Journal of Cleaner Production, 240. 118200. DOI : 10.1016/j.jclepro.2019.118200   DOI
14 M. L. D. Dias & A. R. R. Neto. (2017). Training soft margin support vector machines by simulated annealing: A dual approach. Expert Systems with Applications, 87, 157-169.   DOI
15 R. Bellio, S. Ceschia, L.D. Gaspero, A. Schaerf & T. Urli. (2016). Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers & Operations Research, 65, 83-92.   DOI