MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Journal of Scheduling
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

62 results · 1 filter active ·
Results by year
20022025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
62 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 62 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 62 of 62 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Complexity of One-Cycle Robotic Flow-Shops
Nadia Brauner, Gerd Finke, Wiesław Kubiak
2003· article· en· Journal of Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
50
citations
fundno affno abstractunlabeled
Time slot scheduling of compatible jobs
Marc Demange, D. de Werra, Jérôme Monnot, Vangélis Th. Paschos
2007· article· en· Journal of Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
41
citations
afffundno abstractunlabeled
Solving a wind turbine maintenance scheduling problem
Aurélien Froger, Michel Gendreau, Jorge E. Mendoza, Éric Pinson, Louis-Martin Rousseau
2017· article· en· Journal of Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Assigning multiple activities to work shifts
Quentin Lequy, Mathieu Bouchard, Guy Desaulniers, François Soumis, B Tachefine
2010· article· en· Journal of Scheduling· Decision Sciences
distilled prediction:candidate · metaresearchconsensus · none
26
citations
afffundno abstractunlabeled
Scheduling shared continuous resources on many-cores
Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers +2 more
2017· article· en· Journal of Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Scheduling semi-malleable jobs to minimize mean flow time
Yann Hendel, Wiesław Kubiak, Denis Trystram
2013· article· en· Journal of Scheduling· Engineering
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
4
citations
next →

How this was built: Screen · Findings · About