Citations (60)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (11)
Elad Shufan, Tal Grinshpoun, Ehud Ikar & Hagai Ilani. (2023) Reentrant flow shop with identical jobs and makespan criterion. International Journal of Production Research 61:1, pages 183-197.
Read now
Read now
Youngbum Hur, Jonathan F. Bard & Rodolfo Chacon. (2019) Hierarchy machine set-up for multi-pass lot scheduling at semiconductor assembly and test facilities. International Journal of Production Research 57:14, pages 4351-4370.
Read now
Read now
Win-Chin Lin, Chin-Chia Wu, Kejian Yu, Yong-Han Zhuang & Shang-Chia Liu. (2017) On the Use of Genetic Algorithm for Solving Re-entrant Flowshop Scheduling with Sum-of-processing-times-based Learning Effect to Minimize Total Tardiness. Intelligent Automation & Soft Computing 0:0, pages 1-11.
Read now
Read now
Wenyou Jia, Hao Chen, Li Liu, Zhibin Jiang & You Li. (2017) Full-batch-oriented scheduling algorithm on batch processing workstation of β→β type with re-entrant flow. International Journal of Computer Integrated Manufacturing 30:10, pages 1029-1042.
Read now
Read now
Jianyou Xu, Win-Chin Lin, Junjie Wu, Shuenn-Ren Cheng, Zi-Ling Wang & Chin-Chia Wu. (2016) Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration. International Journal of Computational Intelligence Systems 9:6, pages 1082-1100.
Read now
Read now
Hamidreza Eskandari & Amirhamed Hosseinzadeh. (2014) A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times. Journal of the Operational Research Society 65:8, pages 1221-1231.
Read now
Read now
Chettha Chamnanlor, Kanchana Sethanan, Chen-Fu Chien & Mitsuo Gen. (2014) Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy. International Journal of Production Research 52:9, pages 2612-2629.
Read now
Read now
S-W Choi & Y-D Kim. (2007) Minimizing makespan on a two-machine re-entrant flowshop. Journal of the Operational Research Society 58:7, pages 972-981.
Read now
Read now
W Q Huang & L Wang. (2006) A local search method for permutation flow shop scheduling. Journal of the Operational Research Society 57:10, pages 1248-1251.
Read now
Read now
Jen-Shiang Chen & Jason Chao-Hsien Pan. (2006) Integer programming models for the re-entrant shop scheduling problems. Engineering Optimization 38:5, pages 577-592.
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
Articles from other publishers (49)
Lei Liu & Marcello Urgo. (2023) Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions. Annals of Operations Research.
Crossref
Crossref
Maedeh Fasihi, Reza Tavakkoli-Moghaddam & Fariborz Jolai. (2023) A bi-objective re-entrant permutation flow shop scheduling problem: minimizing the makespan and maximum tardiness. Operational Research 23:2.
Crossref
Crossref
Achmad Pratama Rifai, Setyo Tri Windras Mara & Andi Sudiarso. (2021) Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time. Expert Systems with Applications 183, pages 115339.
Crossref
Crossref
Angel A. Juan, Pedro Copado, Javier Panadero, Christoph Laroque & Rocio de la Torre. (2020) A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering. A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering.
Tae-Sun Yu & Michael Pinedo. (2020) Flow shops with reentry: Reversibility properties and makespan optimal schedules. European Journal of Operational Research 282:2, pages 478-490.
Crossref
Crossref
Yong Cheng & Deming Lei. (2018) An Improved Imperialist Competitive Algorithm for Reentrant Flow Shop Scheduling. An Improved Imperialist Competitive Algorithm for Reentrant Flow Shop Scheduling.
Chin-Chia Wu, Shang-Chia Liu, T. C. E. Cheng, Yu Cheng, Shi-Yuan Liu & Win-Chin Lin. (2017) Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan. Iranian Journal of Science and Technology, Transactions A: Science 42:2, pages 727-744.
Crossref
Crossref
Bin Qian, Zuo-cheng Li & Rong Hu. (2017) A copula-based hybrid estimation of distribution algorithm for m-machine reentrant permutation flow-shop scheduling problem. Applied Soft Computing 61, pages 921-934.
Crossref
Crossref
Chettha Chamnanlor, Kanchana Sethanan, Mitsuo Gen & Chen-Fu Chien. (2015) Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. Journal of Intelligent Manufacturing 28:8, pages 1915-1931.
Crossref
Crossref
Joost Van Pinxten, Umar Waqas, Marc Geilen, Twan Basten & Lou Somers. (2017) Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems. ACM Transactions on Embedded Computing Systems 16:5s, pages 1-20.
Crossref
Crossref
Achmad P. Rifai, Huu-Tho Nguyen & Siti Zawiah Md Dawal. (2016) Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling. Applied Soft Computing 40, pages 42-57.
Crossref
Crossref
Richard Hinze & Dirk Sackmann. 2016. Operations Research Proceedings 2014. Operations Research Proceedings 2014
221
226
.
Richard Hinze. 2016. Logistics Management. Logistics Management
149
158
.
Seong Woo Choi. (2015) Heuristics for an <i>m</i>-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness. Applied Mechanics and Materials 752-753, pages 890-895.
Crossref
Crossref
Ketki Kulkarni & Jayendran Venkateswaran. (2014) Iterative Simulation and Optimization approach for job shop scheduling. Iterative Simulation and Optimization approach for job shop scheduling.
Jianyou Xu, Yunqiang Yin, T.C.E. Cheng, Chin-Chia Wu & Shusheng Gu. (2014) A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan. Applied Soft Computing 24, pages 277-283.
Crossref
Crossref
BongJoo Jeong & Yeong-Dae Kim. (2014) Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times. Computers & Operations Research 47, pages 72-80.
Crossref
Crossref
Adeyanju Sosimi, Folorunso Oladimeji Ogunwolu & Taoreed Adegbola. (2014) A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm. Journal of Industrial Engineering 2014, pages 1-10.
Crossref
Crossref
Chettha Chamnanlor, Kanchana Sethanan, Chen-Fu Chien & Mitsuo Gen. (2013) Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows. Industrial Engineering and Management Systems 12:4, pages 306-316.
Crossref
Crossref
Bin Qian, Jing Wan, Bo Liu, Rong Hu & Guo-Lin Che. (2013) A DE-based algorithm for reentrant permutation flow-shop scheduling with different job reentrant times. A DE-based algorithm for reentrant permutation flow-shop scheduling with different job reentrant times.
Danping Lin, C.K.M. Lee & William Ho. (2013) Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop. Engineering Applications of Artificial Intelligence 26:4, pages 1282-1290.
Crossref
Crossref
Richard Hinze, Dirk Sackmann, Udo Buscher & Gerhard Aust. (2013) A Contribution to the Reentrant Flow-Shop Scheduling Problem. IFAC Proceedings Volumes 46:9, pages 718-723.
Crossref
Crossref
Atefeh Moghaddam, Farouk Yalaoui & Lionel Amodeo. 2012. Computational Intelligence Systems in Industrial Engineering. Computational Intelligence Systems in Industrial Engineering
271
293
.
M. Hekmatfar, S.M.T. Fatemi Ghomi & B. Karimi. (2011) Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Applied Soft Computing 11:8, pages 4530-4539.
Crossref
Crossref
Caixia Jing, Wanzhen Huang & Guochun Tang. (2011) Minimizing total completion time for re-entrant flow shop scheduling problems. Theoretical Computer Science 412:48, pages 6712-6719.
Crossref
Crossref
Hang-Min Cho, Suk-Joo Bae, Jungwuk Kim & In-Jae Jeong. (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Computers & Industrial Engineering 61:3, pages 529-541.
Crossref
Crossref
Carman K. M. Lee, Danping Lin, William Ho & Zhang Wu. (2011) Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs. The International Journal of Advanced Manufacturing Technology 56:9-12, pages 1105-1113.
Crossref
Crossref
Y.C. Chang & W.T. Huang. (2010) A Modification of Simplified Drum-Buffer-Rope for Re-entrant Flow Shop Scheduling. Information Technology Journal 10:1, pages 40-50.
Crossref
Crossref
C. K. M. Lee & Danping Lin. (2010) Hybrid genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs. Hybrid genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs.
Feng Chu, Chengbin Chu & Caroline Desprez. (2010) Series production in a basic re-entrant shop to minimize makespan or total flow time. Computers & Industrial Engineering 58:2, pages 257-268.
Crossref
Crossref
Toshiya Kaihara, Nobutada Fujii, Hiroyuki Hasegawa & Shinji Kurose. 2010. Service Robotics and Mechatronics. Service Robotics and Mechatronics
263
268
.
Andreas Klemmt, Sven Horn, Gerald Weigert & Klaus-Jürgen Wolter. (2009) Simulation-based optimization vs. mathematical programming: A hybrid approach for optimizing scheduling problems. Robotics and Computer-Integrated Manufacturing 25:6, pages 917-925.
Crossref
Crossref
Seong-Woo Choi & Yeong-Dae Kim. (2009) Minimizing total tardiness on a two-machine re-entrant flowshop. European Journal of Operational Research 199:2, pages 375-384.
Crossref
Crossref
Salleh Ahmad Bareduan & Sulaiman Hasan. (2009) Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines. Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines.
Frederic Dugardin, Lionel Amodeo & Farouk Yalaoui. (2009) Multiobjective scheduling of a reentrant hybrid flowshop. Multiobjective scheduling of a reentrant hybrid flowshop.
Ingy A. El-Khouly, Khaled S. El-Kilany & Aziz E. El-Sayed. (2009) Modelling and simulation of re-entrant flow shop scheduling: An application in semiconductor manufacturing. Modelling and simulation of re-entrant flow shop scheduling: An application in semiconductor manufacturing.
Hyun-Seon Choi, Hyung-Won Kim, Dong-Ho Lee, Junggee Yoon, Chang Yeon Yun & Kevin B. Chae. (2008) Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates. The International Journal of Advanced Manufacturing Technology 42:9-10, pages 963-973.
Crossref
Crossref
Sang-Jin Lee & Tae-Eog Lee. (2008) Scheduling a multi-chip package assembly line with reentrant processes and unrelated parallel machines. Scheduling a multi-chip package assembly line with reentrant processes and unrelated parallel machines.
S. A. Bareduan & S. H. Hasan. (2008) Bottleneck adjacent matching 4 (BAM4) heuristic for re-entrant flow shop with dominant machine. Bottleneck adjacent matching 4 (BAM4) heuristic for re-entrant flow shop with dominant machine.
S. A. Bareduan & S. H. Hasan. (2008) Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine. Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine.
Caixia Jing, Xingsan Qian & Guochun Tang. (2008) Two-Machine Flow Shop Scheduling with Re-entrance. Two-Machine Flow Shop Scheduling with Re-entrance.
Caixia Jing, Guochun Tang & Xingsan Qian. (2008) Heuristic algorithms for two machine re-entrant flow shop. Theoretical Computer Science 400:1-3, pages 137-143.
Crossref
Crossref
Dar-Li Yang, Wen-Hung Kuo & Maw-Sheng Chern. (2008) Multi-family scheduling in a two-machine reentrant flow shop with setups. European Journal of Operational Research 187:3, pages 1160-1170.
Crossref
Crossref
Seong-Woo Choi & Yeong-Dae Kim. (2008) Minimizing makespan on an -machine re-entrant flowshop. Computers & Operations Research 35:5, pages 1684-1696.
Crossref
Crossref
Jen-Shiang Chen, Jason Chao-Hsien Pan & Chien-Kuang Wu. (2008) Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Systems with Applications 34:3, pages 1924-1930.
Crossref
Crossref
Jen-Shiang Chen, Jason Chao-Hsien Pan & Chien-Min Lin. (2008) A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Systems with Applications 34:1, pages 570-577.
Crossref
Crossref
Jen-Shiang Chen, Jason Chao-Hsien Pan & Chien-Kuang Wu. (2006) Minimizing makespan in reentrant flow-shops using hybrid tabu search. The International Journal of Advanced Manufacturing Technology 34:3-4, pages 353-361.
Crossref
Crossref
Jen-Shiang Chen. (2005) A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. The International Journal of Advanced Manufacturing Technology 29:11-12, pages 1186-1193.
Crossref
Crossref
C.-C. Huang *S.-H. Liu. (2005) A novel approach to lean control for Taiwan-funded enterprises in mainland China. International Journal of Production Research 43:12, pages 2553-2575.
Crossref
Crossref