Citations (44)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (7)
Hamed Samarghandi. (2015) A particle swarm optimisation for the no-wait flow shop problem with due date constraints. International Journal of Production Research 53:9, pages 2853-2870.
Read now
Read now
J. Behnamian, S.M.T. Fatemi Ghomi & M. Zandieh. (2010) Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. International Journal of Production Research 48:5, pages 1415-1438.
Read now
Read now
Chun-Lung Chen & Chuen-Lung Chen. (2008) Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines. International Journal of Production Research 46:22, pages 6415-6430.
Read now
Read now
S.-W. Choi, Y.-D. Kim
& G.-C. Lee. (2005) Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research 43:11, pages 2149-2167.
Read now
Read now
G.-C. Lee, Y.-D. Kim & S.-W. Choi. (2004) Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research 42:1, pages 165-181.
Read now
Read now
G-C Lee, Y-D Kim, J-G Kim & S-H Choi. (2003) A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. Journal of the Operational Research Society 54:10, pages 1038-1049.
Read now
Read now
UNGI JOO. (2001) JOB ASSIGNMENT ALGORITHMS ON UNIFORM PARALLEL MACHINES. Engineering Optimization 33:3, pages 351-371.
Read now
Read now
Articles from other publishers (37)
Mehmet ERTEM & Mujgan SAGİR OZDEMİR. (2023) PARALEL İŞLEMCİLİ ESNEK AKIŞ ATÖLYESİ ÇİZELGELEME PROBLEMLERİ İÇİN STOKASTİK ÇÖZÜM YAKLAŞIMIA STOCHASTIC SOLUTION APPROACH TO FLEXIBLE FLOWSHOP SCHEDULING PROBLEMS. Endüstri Mühendisliği 34:0, pages 69-90.
Crossref
Crossref
Khalil Tliba, Thierno M. L. Diallo, Olivia Penas, Romdhane Ben Khalifa, Noureddine Ben Yahia & Jean-Yves Choley. (2022) Digital twin-driven dynamic scheduling of a hybrid flow shop. Journal of Intelligent Manufacturing 34:5, pages 2281-2306.
Crossref
Crossref
Haotian Zhang, Yingjun Ji, Ziyan Zhao & Shixin Liu. (2022) Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem. Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem.
Falk T. Gerpott, Sebastian Lang, Tobias Reggelin, Hartmut Zadek, Poti Chaopaisarn & Sakgasem Ramingwong. (2022) Integration of the A2C Algorithm for Production Scheduling in a Two-Stage Hybrid Flow Shop Environment. Procedia Computer Science 200, pages 585-594.
Crossref
Crossref
Luís Miguel Martins, Nuno Octávio Garcia Fernandes, Maria Leonilde Rocha Varela, Luís Miguel Silva Dias, Guilherme Augusto Borges Pereira & Sílvio Carmo Silva. (2020) Comparative study of autonomous production control methods using simulation. Simulation Modelling Practice and Theory 104, pages 102142.
Crossref
Crossref
Vahid Riahi, Raymond Chiong & Yuli Zhang. (2020) A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion. Computers & Operations Research 117, pages 104839.
Crossref
Crossref
Biao Zhang, Quan-ke Pan, Liang Gao, Xin-yu Li, Lei-lei Meng & Kun-kun Peng. (2019) A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Computers & Industrial Engineering 136, pages 325-344.
Crossref
Crossref
Victor Fernandez-Viagas, Paz Perez-Gonzalez & Jose M. Framinan. (2019) Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Computers & Operations Research 109, pages 77-88.
Crossref
Crossref
Biao Zhang, Quan-ke Pan, Liang Gao, Xin-li Zhang & Kun-kun Peng. (2018) A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem. Soft Computing 23:17, pages 8101-8129.
Crossref
Crossref
Wanida Laoraksakiat & Krisada Asawarungsaengkul. 2019. Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015). Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015)
183
194
.
Daniel Schubert, André Scholz & Gerhard Wäscher. (2018) Integrated order picking and vehicle routing with due dates. OR Spectrum 40:4, pages 1109-1139.
Crossref
Crossref
Hamed Samarghandi & Mehdi Behroozi. (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research 81, pages 141-159.
Crossref
Crossref
Edwards A. Silver, David F. Pyke & Douglas J. Thomas. 2016. Inventory and Production Management in Supply Chains. Inventory and Production Management in Supply Chains
661
712
.
M. Saravanan, S. Sridhar & N. Harikannan. (2016) Minimization of Mean Tardiness in Hybrid Flow Shop with Missing Operations Using Genetic Algorithm. Journal of Advanced Manufacturing Systems 15:02, pages 43-55.
Crossref
Crossref
Huixin Tian, Kun Li & Wei Liu. (2016) A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time. Mathematical Problems in Engineering 2016, pages 1-11.
Crossref
Crossref
Hamed Samarghandi & Mehdi Behroozi. (2016) An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints. IFAC-PapersOnLine 49:12, pages 1803-1808.
Crossref
Crossref
Zhan-tao Li, Jianjun Liu, Qing-xin Chen, Ning Mao & Xiaoming Wang. (2015) Approximation algorithms for the three-stage flexible flow shop problem with mid group constraint. Expert Systems with Applications 42:7, pages 3571-3584.
Crossref
Crossref
J. Behnamian. 2015. Handbook of Research on Artificial Intelligence Techniques and Algorithms. Handbook of Research on Artificial Intelligence Techniques and Algorithms
478
508
.
Wen Shi, Xueyan Song & Jizhou Sun. (2014) Automatic Heuristic Generation with Scatter Programming to Solve the Hybrid Flow Shop Problem. Advances in Mechanical Engineering 7:2, pages 587038.
Crossref
Crossref
J. Behnamian, S. M. T. Fatemi Ghomi & M. Zandieh. (2014) Realistic variant of just-in-time flowshop scheduling: integration of L p -metric method in PSO-like algorithm. The International Journal of Advanced Manufacturing Technology 75:9-12, pages 1787-1797.
Crossref
Crossref
Ren Ju, Zhang Yaoxue & Chen Jianer. (2013) Analysis on the Scheduling Problem in Transparent Computing. Analysis on the Scheduling Problem in Transparent Computing.
Christian A. Ullrich. (2013) Integrated machine scheduling and vehicle routing with time windows. European Journal of Operational Research 227:1, pages 152-165.
Crossref
Crossref
Guilherme B. Mainieri & Débora P. Ronconi. (2012) New heuristics for total tardiness minimization in a flexible flowshop. Optimization Letters 7:4, pages 665-684.
Crossref
Crossref
Pedro Gómez-Gasquet, Carlos Andrés & Francisco-Cruz Lario. (2012) An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan. Expert Systems with Applications 39:9, pages 8095-8107.
Crossref
Crossref
Guilherme Barroso Mainieri & Débora Pretti Ronconi. (2010) Regras de despacho para a minimização do atraso total no ambiente flowshop flexível. Gestão & Produção 17:4, pages 683-692.
Crossref
Crossref
Rubén Ruiz & José Antonio Vázquez-Rodríguez. (2010) The hybrid flow shop scheduling problem. European Journal of Operational Research 205:1, pages 1-18.
Crossref
Crossref
Imma Ribas, Rainer Leisten & Jose M. Framiñan. (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research 37:8, pages 1439-1454.
Crossref
Crossref
J. Behnamian, S.M.T. Fatemi Ghomi & M. Zandieh. (2009) A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Systems with Applications 36:8, pages 11057-11069.
Crossref
Crossref
Chun-Lung Chen & Chuen-Lung Chen. (2009) Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering 56:4, pages 1393-1401.
Crossref
Crossref
Carlos Andres, Pedro Gomez & Jose P. Garcia-Sabater. (2006) Comparing dispatching rules in dynamic hybrid flow shops. Comparing dispatching rules in dynamic hybrid flow shops.
Daeyoung Chung, Kichang Lee, Kitae Shin & Jinwoo Park. (2005) A new approach to job shop scheduling problems with due date constraints considering operation subcontracts. International Journal of Production Economics 98:2, pages 238-250.
Crossref
Crossref
S. Bertel & J.-C. Billaut. (2004) A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research 159:3, pages 651-662.
Crossref
Crossref
Shiu Hong Choi & James Siu Lung Lee. (2000) Operational decisions for minimization of penalty cost in non‐pre‐emptive FMS. Integrated Manufacturing Systems 11:5, pages 311-320.
Crossref
Crossref
Wendong Xiao, Peifeng Hao, Sen Zhang & Xinhe Xu. (2000) Hybrid flow shop scheduling using genetic algorithms. Hybrid flow shop scheduling using genetic algorithms.
Klaus Brockmann & Wilhelm Dangelmaier. 2000. Operations Research Proceedings 1999. Operations Research Proceedings 1999
360
365
.
Shaukat A Brah & Luan Luan Loo. (1999) Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research 113:1, pages 113-122.
Crossref
Crossref
Shaukat A. Brah & Gloria E. Wheeler. (2016) Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation. SIMULATION 71:5, pages 302-311.
Crossref
Crossref