An efficient knowledge-based algorithm for the flexible job shop scheduling problem-Reference-Cited by-同舟云学术

An efficient knowledge-based algorithm for the flexible job shop scheduling problem

Published:2012-12 Issue: Volume:36 Page:236-244
ISSN:0950-7051
Container-title:Knowledge-Based Systems
language:en
Short-container-title:Knowledge-Based Systems

Author:

Karimi Hamid,Rahmati Seyed Habib A.,Zandieh M.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Management Information Systems,Software

Reference35 articles.

1. A variable neighborhood search for graph coloring;Avanthay;European Journal of Operational Research,2003

2. J.W. Barnes, J.B. Chambers, Flexible Job Shop Scheduling by Tabu Search, Graduate Program in Operations Research and Industrial Engineering, University of Texas, Austin, Technical Report Series, ORP, 1996, pp. 96–109.

3. Routing and scheduling in a flexible job shop by tabu search;Brandimarte;Annals of Operations Research,1993

4. Job-shop scheduling with multipurpose machines;Brucker;Computing,1990

5. Memory-enhanced evolutionary algorithms for dynamic optimization problems;Branke,1999

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The flexible job shop scheduling problem: A review;European Journal of Operational Research;2024-04

2. 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;2024

3. Deterministic Testbed Problems for Scheduling in Job Shops’ Based Manufacturing Configuration;Lecture Notes in Mechanical Engineering;2024

4. Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system;Expert Systems with Applications;2023-04

5. Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review;Advanced Engineering Informatics;2022-10