Iris Unimi Prodmetadata only
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
scheduling, rescheduling, integer linear programming, dynamic programming, branch-and-bound, settore mat/09 - ricerca operativa
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 274657
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.