A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem-Reference-Cited by-同舟云学术

A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem

Published:2010-07 Issue:7 Volume:42 Page:641-670
ISSN:0305-215X
Container-title:Engineering Optimization
language:en
Short-container-title:Engineering Optimization

Author:

Zhang Rui,Wu Cheng

Publisher

Informa UK Limited

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/03052150903369845

Reference58 articles.

1. The Shifting Bottleneck Procedure for Job Shop Scheduling

2. Tabu search for minimizing total tardiness in a job shop

3. Two new rules to minimize tardiness in a job shop

4. A review of particle swarm optimization. Part I: background and development

5. A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications

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

1. An Improved Cuckoo Search Algorithm under Bottleneck-Degree-Based Search Guidance for Large-Scale Inter-Cell Scheduling Optimization;Applied Sciences;2024-01-24

2. Research on Flexible Job Shop Scheduling Optimization Based on Segmented AGV;Computer Modeling in Engineering & Sciences;2023

3. Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition;Information Sciences;2021-04

4. A Route Clustering and Search Heuristic for Large-Scale Multidepot-Capacitated Arc Routing Problem;IEEE Transactions on Cybernetics;2021

5. Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics;Expert Systems with Applications;2020-09