arbiter
JournalsAccount

A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility

Yang Thomas Zhou et al.

Computers and Operations Research2026https://doi.org/10.1016/j.cor.2026.107439article
AJG 3ABDC A
Weight
0.50

Abstract

No abstract available.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.cor.2026.107439

Or copy a formatted citation

@article{yang2026,
  title        = {{A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility}},
  author       = {Yang Thomas Zhou et al.},
  journal      = {Computers and Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.cor.2026.107439},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.