Botta-Genoulaz, V. (2000). “Hybrid Flow Shop Scheduling with Precedence Constraints and Time Lags to Minimize Maximum Lateness”, International Journal of Production Economics, 64(1-3), 101-111.
Dios, M., Fernandez-Viagas, V. and Framinan, J. M. (2018). “Efficient Heuristics for the Hybrid Flow Shop Scheduling Problem with Missing Operations”, Computers & Industrial Engineering, 115, 88-99.
Dugardin, F., Yalaoui, F. and Amodeo, L. (2010). “New multi-objective Method to Solve Reentrant Hybrid Flow Shop Scheduling Problem”, European Journal of Operational Research, 203(1), 22-31.
Engin, O. and Döyen, A. (2004). “A New Approach to Solve Hybrid Flow Shop Scheduling Problems by Artificial İmmune System”, Future generation computer systems, 20(6), 1083-1095.
Fattahi, P., Hosseini, S. M. H., Jolai, F. andTavakkoli-Moghaddam, R. (2014). “A Branch and Bound Algorithm for Hybrid Flow Shop Scheduling Problem with Setup Time and Assembly Operations”, Applied Mathematical Modelling, 38(1), 119-134.
Gholami, M., Zandieh, M. and Alem-Tabriz, A. (2009). “Scheduling Hybrid Flow Shop with Sequence-Dependent Setup Times and Machines with Random Breakdowns”, The International Journal of Advanced Manufacturing Technology, 42(1-2), 189-201.
Hidri, L., Elkosantini, S. and Mabkhot, M. M. (2018). “Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times”, IEEE Access, 6, 21788-21801.
Janiak, A., Kozan, E., Lichtenstein, M. and Oğuz, C. (2007). “Metaheuristic Approaches to the Hybrid Flow Shop Scheduling Problem with A Cost-Related Criterion”,. International journal of production economics, 105(2), 407-424.
Kizilay, D., Tasgetiren, M. F., Pan, Q. K. and Wang, L. (2014). “An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion”, 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, 16-23.
Komaki, G. M., Teymourian, E., and Kayvanfar, V. (2016). “Minimising Makespan in the Two-Stage Assembly Hybrid Flow Shop Scheduling Problem Using Artificial Immune Systems”, International Journal of Production Research, 54(4), 963-983.
Lee, T. and Loong, Y. (2019). “A Review of Scheduling Problem and Resolution Methods in Flexible Flow Shop”, International Journal of Industrial Engineering Computations, 10(1), 67-88.
Lei, D. (2015). “Two-Phase Neighborhood Search Algorithm for Two-Agent Hybrid Flow Shop Scheduling Problem”, Applied Soft Computing, 34, 721-727.
Li, J. Q., Pan, Q. K. and Wang, F. T. (2014). “A Hybrid Variable Neighborhood Search for Solving the Hybrid Flow Shop Scheduling Problem”. Applied Soft Computing, 24, 63-77.
Li, J. Q., Sang, H. Y., Han, Y. Y., Wang, C. G. and Gao, K. Z. (2018). “Efficient Multi-Objective Optimization Algorithm for Hybrid Flow Shop Scheduling Problems with Setup Energy Consumptions”, Journal of Cleaner Production, 181, 584-598.
Liao, C. J., Tjandradjaja, E. and Chung, T. P. (2012). “An Approach Using Particle Swarm Optimization and Bottleneck Heuristic To Solve Hybrid Flow Shop Scheduling Problem”, Applied Soft Computing, 12(6), 1755-1764.
Lin, J. T. and Chen, C. M. (2015). “Simulation Optimization Approach for Hybrid Flow Shop Scheduling Problem in Semiconductor Back-End Manufacturing”, Simulation Modelling Practice and Theory, 51, 100-114.
Linn, R. and Zhang, W. (1999). “Hybrid Flow Shop Scheduling: A Survey”, Computers & industrial engineering, 37(1-2): 57-61.
Luo, H., Du, B., Huang, G. Q., Chen, H. and Li, X. (2013). “Hybrid Flow Shop Scheduling Considering Machine Electricity Consumption Cost”, International Journal of Production Economics, 146(2), 423-439.
Marichelvam, M. K., Prabaharan, T. and Yang, X. S. (2014). “Improved Cuckoo Search Algorithm for Hybrid Flow Shop Scheduling Problems to Minimize Makespan”, Applied Soft Computing, 19, 93-101.
Mirsanei, H. S., Zandieh, M., Moayed, M. J. and Khabbazi, M. R. (2011). “A Simulated Annealing Algorithm Approach to Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times”, Journal of Intelligent Manufacturing, 22(6), 965-978.
Moccellin, J. V., Nagano, M. S., Neto, A. R. P., and de Athayde Prata, B. (2018). “Heuristic Algorithms for Scheduling Hybrid Flow Shops with Machine Blocking and Setup Times”, Journal of the Brazilian Society of Mechanical Sciences and Engineering, 40(2), 40.
Naderi, B., Gohari, S. and Yazdani, M. (2014). “Hybrid Flexible Flowshop Problems: Models and Solution Methods”, Applied Mathematical Modelling, 38(24), 5767-5780.
Naderi, B., Ruiz, R.A and Zandieh, M. (2010). “Algorithms for a Realistic Variant of Flowshop Scheduling”, Computers & Operations Research, 37(2), 236-246.
Naderi, B., Zandieh, M., Balagh, A. K. G. and Roshanaei, V. (2009). “An Improved Simulated Annealing for Hybrid Flowshops with Sequence-Dependent Setup and Transportation Times to Minimize Total Completion Time and Total Tardiness”, Expert systems with Applications, 36(6), 9625-9633.
Nawaz, M., Enscore Jr, E. E. and Ham, I. (1983). “A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem”, Omega, 11(1), 91-95.
Pan, Q. K., Gao, L., Li, X. Y. and Gao, K. Z. (2017). “Effective Metaheuristics for Scheduling a Hybrid Flowshop with Sequence-Dependent Setup Times”, Applied Mathematics and Computation, 303, 89-112.
Pinedo ML (2008). “Scheduling: theory, algorithms and systems”. 3rd edn. Springer, New York.
Ribas, I., Leisten, R. and Framiñan, J. M. (2010). “Review and Classification of Hybrid Flow Shop Scheduling Problems from A Production System and A Solutions Procedure Perspective”, Computers & Operations Research, 37(8), 1439-1454.
Ruiz, R., Şerifoğlu, F. S. and Urlings, T. (2008). “Modeling Realistic Hybrid Flexible Flowshop Scheduling Problems”, Computers & Operations Research, 35(4), 1151-1175.
Ruiz, R. and Vázquez-Rodríguez, J. A. (2010). “The Hybrid Flow Shop Scheduling Problem”, European journal of operational research, 205(1), 1-18.
Taillard, E. (1990). “Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem”, European journal of Operational research, 47(1), 65-74.
Turner, S. and Booth, D. (1987). “Comparison of Heuristics for Flow Shop Sequencing”, Omega, 15(1), 75-78.
Wang, L., Pan, Q. K., Suganthan, P. N., Wang, W. H. and Wang, Y. M. (2010). “A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems”, Computers & Operations Research, 37(3), 509-520.
Varela, M. L., Trojanowska, J., Carmo-Silva, S., Costa, N. M. and Machado, J. (2017). “Comparative Simulation study of Production Scheduling in the Hybrid and the Parallel Flow”, Management and Production Engineering Review, 8(2), 69-80.
Zabihzadeh, S. S. and Rezaeian, J. (2016). “Two Meta-heuristic Algorithms for Flexible Flow Shop Scheduling Problem with Robotic Transportation and Release Time”, Applied Soft Computing, 40, 319-330.
Zandieh, M., Ghomi, S. F. and Husseini, S. M. (2006). “An İmmune Algorithm Approach to Hybrid Flow Shops Scheduling with Sequence-Dependent Setup Times”, Applied Mathematics and Computation, 180(1), 111-127.
Zhang, B., Pan, Q. K., Gao, L., Zhang, X. L., Sang, H. Y. and Li, J. Q. (2017). “An Effective Modified Migrating Birds Optimization for Hybrid Flowshop Scheduling Problem with Lot Streaming”, Applied Soft Computing, 52, 14-27.
Zhong, W. Y. and Lv, L. H. (2014). “Hybrid Flowshop Scheduling with Interstage Job Transportation”, Journal of the Operations Research Society of China, 2(1), 109-121.
Zhu, H. (2012). “A Two Stage Scheduling with Transportation and Batching”,. Information Processing Letters, 112(19), 728-731.
- Abstract viewed - 65 times
- PDF downloaded - 39 times
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
© , 2019
Fatma Selen MADENOĞLU
Asistant Prof. Dr., Abdullah Gul University
How to Cite
SOLVING THE HYBRID FLOW SHOP SCHEDULING PROBLEM USING HEURISTIC ALGORITHMS
Vol 7 No 3 (2019): BUSINESS & MANAGEMENT STUDIES: AN INTERNATIONAL JOURNAL
Submitted: Aug 28, 2019
Published: Aug 28, 2019
A variant of the hybrid ﬂow shop (HFS) problem considering missing operations, transportation times and sequence-dependent setup times is investigated. Heuristic algorithms along with dispatching rulesand dispatching rules are used to solve the given problem. The objective function is minimization makespan. The computational experimets are conducted to test the performance of the heuristic algoirthms and dispatching rules. In order to depict the effect of the factors: number of jobs, number of machines, number of production stages, level of missing operations on the result, the additiol experimentes are carried out. The result of NEH heuristic with SPTF rule outperformed other heuristics for the proposed HFS problems.