๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

โœ Scribed by Michael Andresen, Tanka Nath Dhamala


Book ID
113060839
Publisher
Springer US
Year
2012
Tongue
English
Weight
965 KB
Volume
196
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES