An iterated greedy algorithm for the planning of yarn‐dyeing boilers-Reference-Cited by-同舟云学术

An iterated greedy algorithm for the planning of yarn‐dyeing boilers

Published:2022-11-15 Issue: Volume: Page:
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Demir Yunus¹

Affiliation:

1. Department of Industrial Engineering Bursa Technical University Bursa Turkey

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13232

Reference58 articles.

1. AlEnezi Q. AboElFotoh H. AlBdaiwi B. AlMulla M. A. 2016.Heuristics for the variable sized bin packing problem using a hybrid P‐system and CUDA architecture.arXiv preprintarXiv:1602.08735.

2. A survey of scheduling problems with setup times or costs

3. The third comprehensive survey on scheduling problems with setup times/costs

4. Accelerating column generation for variable sized bin-packing problems

5. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

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

1. Iterated Greedy Algorithms for Combinatorial Optimization: A Systematic Literature Review;2023 20th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA);2023-12-04

2. An iterated greedy algorithm with variable reconstruction size for the obnoxious p‐median problem;International Transactions in Operational Research;2023-07-03