336
Views
39
CrossRef citations to date
0
Altmetric
Original Articles

Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems

&
Pages 1411-1424 | Received 12 Jan 2007, Accepted 23 Apr 2007, Published online: 26 Nov 2008

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (16)

Nilgün İnce, Derya Deliktaş & İhsan Hakan Selvi. (2023) A comprehensive literature review of the flowshop group scheduling problems: systematic and bibliometric reviews. International Journal of Production Research 0:0, pages 1-30.
Read now
Shijin Wang, Wenli Cui, Feng Chu & Jianbo Yu. (2021) The interval min–max regret knapsack packing-delivery problem. International Journal of Production Research 59:18, pages 5661-5677.
Read now
Wei-Wei Cui, Zhiqiang Lu, Binghai Zhou, Chen Li & Xiaole Han. (2016) A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints. International Journal of Computer Integrated Manufacturing 29:9, pages 944-961.
Read now
M. Henneberg & J.S. Neufeld. (2016) A constructive algorithm and a simulated annealing approach for solving flowshop problems with missing operations. International Journal of Production Research 54:12, pages 3534-3550.
Read now
Kuo-Ching Ying. (2015) Scheduling the two-machine flowshop to hedge against processing time uncertainty. Journal of the Operational Research Society 66:9, pages 1413-1425.
Read now
Mahmoud Masoud, Erhan Kozan & Geoff Kent. (2015) Hybrid metaheuristic techniques for optimising sugarcane rail operations. International Journal of Production Research 53:9, pages 2569-2589.
Read now
K-C Ying & S-W Lin. (2014) Efficient wafer sorting scheduling using a hybrid artificial immune system. Journal of the Operational Research Society 65:2, pages 169-179.
Read now
Kuo-Ching Ying & Shih-Wei Lin. (2013) A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Journal of Industrial and Production Engineering 30:6, pages 355-362.
Read now
Behdin Vahedi Nouri, Parviz Fattahi & Reza Ramezanian. (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. International Journal of Production Research 51:12, pages 3501-3515.
Read now
Yong Kuk Park & Jung-Min Yang. (2013) Scheduling of die casting operations including high-mix low-volume and line-type production. International Journal of Production Research 51:6, pages 1728-1744.
Read now
Hamed Samarghandi & Tarek Y. ElMekkawy. (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. International Journal of Production Research 50:24, pages 7313-7326.
Read now
N. Jawahar, Angappa Gunasekaran & N. Balaji. (2012) A simulated annealing algorithm to the multi-period fixed charge distribution problem associated with backorder and inventory. International Journal of Production Research 50:9, pages 2533-2554.
Read now
Chwen Sheu, Lee J. Krajewski & Gangshu Cai. (2012) A heuristic for designing manufacturing focus units with resource considerations. International Journal of Production Research 50:6, pages 1608-1623.
Read now
Lin Li, Jiazhen Huo & Ou Tang. (2011) A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production. International Journal of Production Research 49:15, pages 4679-4700.
Read now
Kuo-Ching Ying, Jatinder N.D. Gupta, Shih-Wei Lin & Zen-Jung Lee. (2010) Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research 48:8, pages 2169-2184.
Read now

Articles from other publishers (23)

Yibing Li, Shijin Jiang & Lei Wang. (2024) Hybrid deep convolution network and differential evolution algorithm for solving non-permutation flow shop scheduling problem. Journal of Intelligent & Fuzzy Systems, pages 1-17.
Crossref
Arshad Ali, Yuvraj Gajpal & Tarek Y. Elmekkawy. (2020) Distributed permutation flowshop scheduling problem with total completion time objective. OPSEARCH 58:2, pages 425-447.
Crossref
Bruno de Athayde Prata, Carlos Diego Rodrigues & Jose Manuel Framinan. (2021) Customer order scheduling problem to minimize makespan with sequence-dependent setup times. Computers & Industrial Engineering 151, pages 106962.
Crossref
Vincent F. Yu, A. A. N. Perwira Redi, Christine Halim & Parida Jewpanya. (2020) The path cover problem: Formulation and a hybrid metaheuristic. Expert Systems with Applications 146, pages 113107.
Crossref
İlker Küçükoğlu & Nursel Öztürk. (2015) A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking. Journal of Intelligent Manufacturing 30:8, pages 2927-2943.
Crossref
Carlos E. Andrade, Simon D. Byers, Vijay Gopalakrishnan, Emir Halepovic, David J. Poole, Lien K. Tran & Christopher T. Volinsky. (2019) Scheduling software updates for connected cars with limited availability. Applied Soft Computing 82, pages 105575.
Crossref
Henry Lau, Ann Dadich, Dilupa Nakandala, Huntley Evans & Li Zhao. (2018) Development of a cost‐optimization model to reduce bottlenecks: A health service case study. Expert Systems 35:6.
Crossref
Alexander J. Benavides & Marcus Ritt. (2018) Fast heuristics for minimizing the makespan in non-permutation flow shops. Computers & Operations Research 100, pages 230-243.
Crossref
Daniel Alejandro Rossit, Fernando Tohmé & Mariano Frutos. (2018) The Non-Permutation Flow-Shop scheduling problem: A literature review. Omega 77, pages 143-153.
Crossref
Song Ye, Ning Zhao, Kaidian Li & Chuanjin Lei. (2017) Efficient heuristic for solving non-permutation flow-shop scheduling problems with maximal and minimal time lags. Computers & Industrial Engineering 113, pages 160-184.
Crossref
Alexander J. Benavides & Marcus Ritt. (2016) Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. Computers & Operations Research 66, pages 160-169.
Crossref
Nivaldo Lemos Coppini, Aparecida de Fátima Castello Rosa, Alexandre Augusto Martins Carvalho & Edson Melo de Souza. (2015) Simulated Annealing Applied to Optimize the Efficiency of Flexible Manufacturing Cells. Applied Mechanics and Materials 778, pages 245-258.
Crossref
Andrea Rossi & Michele Lanzetta. (2013) Native metaheuristics for non-permutation flowshop scheduling. Journal of Intelligent Manufacturing 25:6, pages 1221-1233.
Crossref
Chung-Cheng Lu, Shih-Wei Lin & Kuo-Ching Ying. (2014) Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times. Applied Soft Computing 23, pages 144-151.
Crossref
Alexander J. Benavides, Marcus Ritt & Cristóbal Miralles. (2014) Flow shop scheduling with heterogeneous workers. European Journal of Operational Research 237:2, pages 713-720.
Crossref
Andrea Rossi & Michele Lanzetta. (2013) Scheduling flow lines with buffers by ant colony digraph. Expert Systems with Applications 40:9, pages 3328-3340.
Crossref
Shih-Wei Lin & Kuo-Ching Ying. (2013) Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Computers & Operations Research 40:6, pages 1625-1647.
Crossref
Jung-Min Yang & Yong-Kuk Park. (2012) Scheduling of Die Casting Processes Considering Power Usage. Journal of the Korea Academia-Industrial cooperation Society 13:8, pages 3358-3365.
Crossref
Y. A. Katsigiannis, P. S. Georgilakis & E. S. Karapidakis. (2012) Hybrid Simulated Annealing–Tabu Search Method for Optimal Sizing of Autonomous Power Systems With Renewables. IEEE Transactions on Sustainable Energy 3:3, pages 330-338.
Crossref
James J. Cochran, Louis A. CoxJr.Jr., Pinar Keskinocak, Jeffrey P. Kharoufeh & J. Cole SmithJ. Cole Smith & James J. Cochran. 2011. Wiley Encyclopedia of Operations Research and Management Science. Wiley Encyclopedia of Operations Research and Management Science.
Norozi. (2010) Application of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line. American Journal of Engineering and Applied Sciences 3:1, pages 15-24.
Crossref
Ehram Safari, Seyed Jafar Sadjadi & Kamran Shahanaghi. (2009) Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan. The International Journal of Advanced Manufacturing Technology 46:5-8, pages 757-767.
Crossref
Yibing Li, Shijin Jiang & Lei Wang. (2022) Hybrid Deep Convolution Network and Differential Evolution Algorithm for Solving Non-Permutation Flow Shop Scheduling Problem. SSRN Electronic Journal.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.