319
Views
22
CrossRef citations to date
0
Altmetric
Original Articles

Two hybrid tabu search–firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost

, , &
Pages 470-487 | Received 04 Jun 2013, Accepted 18 Dec 2013, Published online: 06 Feb 2014

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

Read on this site (4)

Mohammad Rohaninejad, Reza Tavakkoli-Moghaddam, Behdin Vahedi-Nouri, Zdeněk Hanzálek & Shadi Shirazian. (2022) A hybrid learning-based meta-heuristic algorithm for scheduling of an additive manufacturing system consisting of parallel SLM machines. International Journal of Production Research 60:20, pages 6205-6225.
Read now
Behdin Vahedi-Nouri, Reza Tavakkoli-Moghaddam, Zdeněk Hanzálek, Hamidreza Arbabi & Mohammad Rohaninejad. (2021) Incorporating order acceptance, pricing and equity considerations in the scheduling of cloud manufacturing systems: matheuristic methods. International Journal of Production Research 59:7, pages 2009-2027.
Read now
James C. Chen, Yin-Yann Chen, Tzu-Li Chen & Jim Z. Lin. (2017) Comparison of simulated annealing and tabu-search algorithms in advanced planning and scheduling systems for TFT-LCD colour filter fabs. International Journal of Computer Integrated Manufacturing 30:6, pages 516-534.
Read now
M. Rabiee, F. Jolai, H. Asefi, P. Fattahi & S. Lim. (2016) A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness. International Journal of Computer Integrated Manufacturing 29:9, pages 1007-1024.
Read now

Articles from other publishers (18)

Nattapol Paisarnvirosrak & Phornprom Rungrueang. (2023) Firefly Algorithm with Tabu Search to Solve the Vehicle Routing Problem with Minimized Fuel Emissions: Case Study of Canned Fruits Transport. LOGI – Scientific Journal on Transport and Logistics 14:1, pages 263-274.
Crossref
Mehmet Akif Şahman & Sedat Korkmaz. (2022) Discrete Artificial Algae Algorithm for solving Job-Shop Scheduling Problems. Knowledge-Based Systems 256, pages 109711.
Crossref
Zhonghua Han, Hongfeng Qi, Daliang Chang, Wei Gong & Shilong Dai. (2022) Research on optimization method of routing buffer linkage based on Q-learning. Journal of Physics: Conference Series 2187:1, pages 012058.
Crossref
K. Gayathri Devi, R. S. Mishra & A. K. Madan. (2022) A Dynamic Adaptive Firefly Algorithm for Flexible Job Shop Scheduling. Intelligent Automation & Soft Computing 31:1, pages 429-448.
Crossref
Zi-Yue Wang & Cong Lu. (2021) An integrated job shop scheduling and assembly sequence planning approach for discrete manufacturing. Journal of Manufacturing Systems 61, pages 27-44.
Crossref
Hongli Yu, Yuelin Gao, Le Wang & Jiangtao Meng. (2020) A Hybrid Particle Swarm Optimization Algorithm Enhanced with Nonlinear Inertial Weight and Gaussian Mutation for Job Shop Scheduling Problems. Mathematics 8:8, pages 1355.
Crossref
Min Liu, Xifan Yao & Yongxiang Li. (2020) Hybrid whale optimization algorithm enhanced with Lévy flight and differential evolution for job shop scheduling problems. Applied Soft Computing 87, pages 105954.
Crossref
Mehdi A. ALİEHYAEİ. (2020) OPTIMIZATION OF MICRO GAS TURBINE BY ECONOMIC, EXERGY AND ENVIRONMENT ANALYSIS USING GENETIC, BEE COLONY AND SEARCHING ALGORITHMS. Journal of Thermal Engineering 6:1, pages 117-140.
Crossref
Xia Shao & Yu Xin. (2019) A scheduling algorithm based on the singular value decomposition heuristic method in a distributed manufacturing system. Expert Systems 36:4.
Crossref
Neha Gupta, Arun Sharma & Manoj Kumar Pachariya. (2019) An Insight Into Test Case Optimization: Ideas and Trends With Future Perspectives. IEEE Access 7, pages 22310-22327.
Crossref
Nikolaos E. Karkalos, Angelos P. Markopoulos & J. Paulo DavimNikolaos E. Karkalos, Angelos P. Markopoulos & J. Paulo Davim. 2019. Computational Methods for Application in Industry 4.0. Computational Methods for Application in Industry 4.0 33 55 .
Liji Shen, Stéphane Dauzère-Pérès & Janis S. Neufeld. (2018) Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research 265:2, pages 503-516.
Crossref
Absalom E. Ezugwu & Francis Akutsah. (2018) An Improved Firefly Algorithm for the Unrelated Parallel Machines Scheduling Problem With Sequence-Dependent Setup Times. IEEE Access 6, pages 54459-54478.
Crossref
Yabo Luo & Yongo P Waden. (2017) Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem. IOP Conference Series: Earth and Environmental Science 69, pages 012181.
Crossref
Mostafa Abouei Ardakan, A. Kourank Beheshti, S. Hamid Mirmohammadi & Hamed Davari Ardakani. (2017) A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem. Numerical Algebra, Control & Optimization 7:4, pages 465-480.
Crossref
Mohammad Rohaninejad, Rashed Sahraeian & Behdin Vahedi Nouri. (2016) Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops. RAIRO - Operations Research 50:3, pages 587-609.
Crossref
Jinhua Shi, Hui Lu & Kefei Mao. 2016. Advances in Swarm Intelligence. Advances in Swarm Intelligence 19 27 .
M. Rohaninejad, R. Tavakkoli-Moghaddam & B. Vahedi-Nouri. (2015) Redundancy Resource Allocation for Reliable Project Scheduling: A Game-theoretical Approach. Procedia Computer Science 64, pages 265-273.
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.