Processing, Please wait...

  • Publisher Home
  • Home
  • 🔙 Back
  • 📚 Journals
    • ⚙️ IJIEC - Industrial Engineering Computations
    • 🌐 IJDNS - Data and Network Science
    • 🧪 CCL - Current Chemistry Letters
    • 💹 AC - Accounting
    • 🎯 DSL - Decision Science Letters
    • 🚛 USCM - Uncertain Supply Chain Management
    • 🏗️ JPM - Journal of Project Management
    • 🏥 HE - Healthcare Engineering
    • 📈 SCI - Scientometrica
    • 🔩 ESM - Engineering Solid Mechanics
    • 🌿 JFS - Journal of Future Sustainability
    • 💼 MSL - Management Science Letters
  • 📝 Submit Article
  • 📊 Statistics
  • 📋 About
    • 📄 About Us
    • 📰 Blog
    • 📢 News
    • 📧 Contact
  • 📺 Tutorial
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time

⭐ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (101)
  • MSL (2658)
  • USCM (1104)
  • HE (51)
  • SCI (52)

IJIEC Volumes

    • ▼ Volume 17 (113)
      • Issue 1 (21)
      • Issue 2 (30)
      • Issue 3 (26)
      • Issue 4 (36)
    • ▼ Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • ▼ Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • ▼ Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • ▼ Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • ▼ Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • ▼ Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • ▼ Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • ▼ Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • ▼ Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • ▼ Volume 3 (77)
      • Issue 1 (10)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • ▼ Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • ▼ Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)

🔑 Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Tehran Stock Exchange(94)
Sustainability(93)
optimization(88)
Financial performance(86)
Trust(85)
TOPSIS(85)
Job satisfaction(81)
Genetic Algorithm(81)
Organizational performance(81)
Social media(80)


» Show all keywords

✍️ Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(70)
Mohammad Reza Iravani(65)
Endri Endri(45)
Hotlan Siagian(43)
Muhammad Alshurideh(42)
Dmaithan Almajali(39)
Jumadil Saputra(37)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Sautma Ronni Basana(33)
Barween Al Kurdi(32)
Basrowi Basrowi(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Ni Nyoman Kerti Yasa(30)
Hassan Ghodrati(30)
Shankar Chakraborty(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Mahmoud Allahham(28)


» Show all authors

🌍 Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (8)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
International Journal of Industrial Engineering Computations
ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 16 Issue 1 pp. 21-36, 2025

A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time Pages 21-36 PDF Download PDF

Authors: Yajie Wu, Shiming Yang, Leilei Meng, Weiyao Cheng, Biao Zhang, Peng Dua

📋 Author Affiliations:
Yajie Wu ORCID , Shiming Yang ORCID , Leilei Meng ORCID , Weiyao Cheng ORCID , Biao Zhang ORCID , Peng Duan
¹ School of Computer Science, Liaocheng University, Liaocheng, 252000, China
doi 10.5267/j.ijiec.2024.11.003
6 Source: Scopus
Crossref 4 Source: CrossRef

🔑 Keywords: Flexible job shop scheduling problem, Sequence dependent setup time, Constraint programming, Variable neighborhood search

Abstract: This study focuses on the flexible job shop scheduling problem with sequence-dependent setup times (FJSP-SDST), and the goal is minimizing the makespan. To solve FJSP-SDST, first, we develop a constraint programming (CP) model to obtain optimal solutions. Due to the NP-hardness of FJSP-SDST, a CP assisted meta-heuristic algorithm (C-VNS-CP) is designed to make use of the advantages of both CP model and cooperative variable neighborhood search (C-VNS). The C-VNS-CP algorithm consists of two stages. The first stage involves C-VNS, for which eight neighborhood structures are defined. In the second stage, CP is used to further optimize the good solution obtained from C-VNS. In order to prove the efficiency of the C-VNS algorithm, CP model, and C-VNS-CP algorithm, experiments of 20 instances are conducted.

How to cite this paper
APA: Wu, Y., Yang, S., Meng, L., Cheng, W., Zhang, B & Dua, P. (2025). A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time. International Journal of Industrial Engineering Computations, 16(1), 21-36.
Chicago/Turabian: Wu, Y., Yang, S., Meng, L., Cheng, W., Zhang, B & Dua, P. 2025. "A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time." International Journal of Industrial Engineering Computations 16, no. 1 (2025): 21-36.
AMA: Wu, Y., Yang, S., Meng, L., Cheng, W., Zhang, B & Dua, P. A novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time. International Journal of Industrial Engineering Computations. 2025;16(1):21-36.

References
Alicastro, M., Ferone, D., Festa, P., Fugaro, S., & Pastore, T. (2021). A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Computers & Operations Research, 131, 105272.
Azzouz, A., Ennigrou, M., & Said, L. B. (2017). A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. Procedia computer science, 112, 457-466.
Bagheri, A., & Zandieh, M. (2011). Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach. Journal of Manufacturing Systems, 30(1), 8-15.
de Abreu, L. R., Araújo, K. A. G., de Athayde Prata, B., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54(9), 1563-1582.
Ham, A. (2020). Transfer-robot task scheduling in flexible job shop. Journal of Intelligent Manufacturing, 31(7), 1783-1793.
Ham, A. (2021). Transfer-robot task scheduling in job shop. International Journal of Production Research, 59(3), 813-823.
Ham, A. M., & Cakici, E. (2016). Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches. Computers & Industrial Engineering, 102, 160-165.
Ham, A., Park, M. J., & Kim, K. M. (2021). Energy‐Aware Flexible Job Shop Scheduling Using Mixed Integer Programming and Constraint Programming. Mathematical Problems in Engineering, 2021(1), 8035806.
Han, X., Cheng, W., Meng, L., Zhang, B., Gao, K., Zhang, C., & Duan, P. (2024). A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm and Evolutionary Computation, 86, 101538.
Karimi, H., Rahmati, S. H. A., & Zandieh, M. (2012). An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowledge-Based Systems, 36, 236-244.
Li, J. Q., Deng, J. W., Li, C. Y., Han, Y. Y., Tian, J., Zhang, B., & Wang, C. G. (2020). An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times. Knowledge-Based Systems, 200, 106032.
Li, M., & Lei, D. (2021). An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times. Engineering Applications of Artificial Intelligence, 103, 104307.
Meng, L., Zhang, B., Gao, K., & Duan, P. (2022). An MILP model for energy-conscious flexible job shop problem with transportation and sequence-dependent setup times. Sustainability, 15(1), 776.
Meng, L., Zhang, C., Zhang, B., & Ren, Y. (2019). Mathematical modeling and optimization of energy-conscious flexible job shop scheduling problem with worker flexibility. IEEE Access, 7, 68043-68059.
Meng, L., Zhang, C., Ren, Y., Zhang, B., & Lv, C. (2020). Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Computers & industrial engineering, 142, 106347.
Meng, L., Zhang, C., Zhang, B., Gao, K., Ren, Y., & Sang, H. (2023). MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times. Swarm and Evolutionary Computation, 82, 101374.
Meng, L., Gao, K., Ren, Y., Zhang, B., Sang, H., & Chaoyong, Z. (2022). Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation, 71, 101058.
Meng, L., Duan, P., Gao, K., Zhang, B., Zou, W., Han, Y., & Zhang, C. (2024). MIP modeling of energy-conscious FJSP and its extended problems: From simplicity to complexity. Expert Systems with Applications, 241, 122594.
Meng, L., Cheng, W., Zhang, B., Zou, W., Fang, W., & Duan, P. (2023). An improved genetic algorithm for solving the multi-AGV flexible job shop scheduling problem. Sensors, 23(8), 3815.
Meng, L., Cheng, W., Zhang, B., Zou, W., & Duan, P. (2024). A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem. International Journal of Industrial Engineering Computations, 15(3), 813-832.
Novas, J. M. (2019). Production scheduling and lot streaming at flexible job-shops environments using constraint programming. Computers & Industrial Engineering, 136, 252-264.
Saidi-Mehrabad, M., & Fattahi, P. (2007). Flexible job shop scheduling with tabu search algorithms. The international journal of Advanced Manufacturing technology, 32, 563-570.
Shen, L., Dauzère-Pérès, S., & Neufeld, J. S. (2018). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European journal of operational research, 265(2), 503-516.
Sun, J., Zhang, G., Lu, J., & Zhang, W. (2021). A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times. Computers & operations research, 132, 105263.
Yazdani, M., Amiri, M., & Zandieh, M. (2010). Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications, 37(1), 678-687.
Zeballos, L. J., Quiroga, O. D., & Henning, G. P. (2010). A constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitations. Engineering Applications of Artificial Intelligence, 23(2), 229-248.
Zhang, G., Yan, S., Song, X., Zhang, D., & Guo, S. (2024). Evolutionary algorithm incorporating reinforcement learning for energy-conscious flexible job-shop scheduling problem with transportation and setup times. Engineering Applications of Artificial Intelligence, 133, 107974.
Zhang, G., Hu, Y., Sun, J., & Zhang, W. (2020). An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm and evolutionary computation, 54, 100664.
Zhang, M., Tan, Y., Zhu, J., Chen, Y., & Chen, Z. (2020). A competitive and cooperative Migrating Birds Optimization algorithm for vary-sized batch splitting scheduling problem of flexible Job-Shop with setup time. Simulation Modelling Practice and Theory, 100, 102065.



  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

📚 Journal: International Journal of Industrial Engineering Computations | 📅 Year: 2025 | 📖 Volume: 16 | 📄 Issue: 1 | 👁️ Views: 1207 | 📊 Crossref: 4

Related Articles:
  • A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem
  • An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion
  • Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times
  • Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints
  • Optimizing combination of job shop scheduling and quadratic assignment problem through multi-objective decision making approach

📝 Ready to share your research?

International Journal of Industrial Engineering Computations is accepting new submissions for upcoming issues. Join our community of authors and publish your work with us.

✓ Open access
✓ Rigorous peer review
✓ Fast publication
📤 Submit Your Manuscript →

📖 Author Guidelines

® 2010-2026 GrowingScience.Com