{"id":"W2104313259","doi":"10.1109/icsmc.2009.5346681","title":"An integer programming model and heuristic algorithm for automatic scheduling in synchrotron facilities","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Canarie","keywords":"Computer science; Integer programming; Scheduling (production processes); Heuristics; Computation; Mathematical optimization; Algorithm; Fair-share scheduling; Job shop scheduling; Two-level scheduling; Mathematics; Schedule; Operating system","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001543438,0.0001472468,0.0001714537,0.0001305624,0.00004698063,0.00009290818,0.00007170794,0.0000752072,0.000009248718],"category_scores_gemma":[0.00003304756,0.0001446904,0.0000258558,0.000109108,0.00001915402,0.0002096099,0.000005300538,0.0001057769,0.000002014761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004298648,"about_ca_system_score_gemma":0.00001445092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006626304,"about_ca_topic_score_gemma":0.000005524453,"domain_scores_codex":[0.999244,0.000009349843,0.0002333611,0.0001743644,0.00008297084,0.0002559222],"domain_scores_gemma":[0.9997202,0.00003020769,0.00001492825,0.0001204627,0.00003474683,0.00007948738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.053263e-7,0.00001850582,0.00001139354,0.00003760558,0.00000405597,6.381943e-7,0.0004039806,0.7023109,0.00004021147,0.0001769036,0.000003525091,0.2969913],"study_design_scores_gemma":[0.0003495395,0.00006395404,0.00004744301,0.000042208,0.000006663704,0.000003602997,0.0005674207,0.9979234,0.0001244747,0.0006732524,0.00001368411,0.0001843595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08701482,0.0002089521,0.9117154,0.0000382309,0.00005548158,0.0002705799,0.000005856942,0.0005726658,0.0001179689],"genre_scores_gemma":[0.3914081,0.000009824735,0.6084073,0.00002426174,0.00002303682,0.00003403134,0.00001081946,0.00001336268,0.00006928584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3043933,"threshold_uncertainty_score":0.5900303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211518659400704,"score_gpt":0.2480512137382205,"score_spread":0.2359360271442135,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}