Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

From MaRDI portal
Revision as of 04:51, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:425519

DOI10.1016/j.ins.2011.08.018zbMath1239.90050OpenAlexW2020049463MaRDI QIDQ425519

Chou-Jung Hsu, Dar-Li Yang, Wen-Hung Kuo

Publication date: 8 June 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.08.018




Related Items



Cites Work


This page was built for publication: Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect