Hal Sciencemetadata only
A new graphical approach for solving single-machine scheduling problems approximately
fully polynomial\-time approximation scheme, graphical algorithm, total weighted tardiness, single\-machine scheduling, [info.info-mo]computer science [cs]/modeling and simulation
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 322396
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.