MétaCan
Menu
Back to cohort
Record W2133877868 · doi:10.1109/icsmc.2004.1399984

Sliding window distributed combinatorial scheduling using JADE

2005· article· en· W2133877868 on OpenAlex
S. Logic, D. Sabaz, W.A. Gruver

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsSliding window protocolComputer scienceJADE (particle detector)Window (computing)Scheduling (production processes)Distributed computingJavaFrame (networking)ScheduleJob shop schedulingReal-time computingMathematical optimizationOperating systemComputer networkMathematics

Abstract

fetched live from OpenAlex

This paper describes a fully decentralized, distributed systems approach to job-shop scheduling within a sliding time frame, implemented using the Java agent development framework (JADE). All agents, with processes inside the current window, schedule operations using a recursive propagation message-passing technique and a combinatorial reordering algorithm. Operations outside the window are neither updated nor scheduled until either the sliding window has advanced to encompass them or until gaps have opened between tasks inside the sliding window to accommodate them.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.931
Threshold uncertainty score0.385

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.035
GPT teacher head0.273
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations13
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicMulti-Agent Systems and NegotiationFrench-language works237,207