Note on the algorithm for Johnson's single-route problem

DOI10.1007/BF01069124MaRDI QIDQ3893293zbMATH OpenOpenAlexFDO

Authors B. I. Dushin

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069124

zbMATH Keywords

algorithmschedulingJohnson's single-route problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(1)

• Performance guarantees for flowshop heuristics to minimize makespan

This page was built for publication: Note on the algorithm for Johnson's single-route problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893293)