{"id":"W7029942517","doi":"","title":"MAKESPAN MINIMIZATION FOR PARALLEL MACHINES SCHEDULING WITH AVAILABILITY CONSTRAINTS","year":2010,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"History of Computing Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Lexicographical order; Minification; Integer programming; Schedule; Linear programming; Single-machine scheduling; Limit (mathematics); Optimization problem","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001363364,0.0002581721,0.0003178843,0.0000525161,0.0001278895,0.00003542212,0.0007596276,0.00008893254,0.00003764128],"category_scores_gemma":[0.00001052989,0.0002326405,0.00002560303,0.00007059787,0.0002846788,0.0001453696,0.0002052836,0.0002028022,2.646951e-9],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006424273,"about_ca_system_score_gemma":0.00173654,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007599609,"about_ca_topic_score_gemma":0.03856583,"domain_scores_codex":[0.9981965,0.00003229449,0.000225942,0.0004299219,0.0008510218,0.0002642504],"domain_scores_gemma":[0.9988561,0.0002061853,0.0003197305,0.0004936743,8.931325e-7,0.000123394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003755238,0.000112975,0.0099562,0.001666599,0.0003698984,0.000105873,0.0001980979,0.0006109669,0.002188967,0.693832,0.08921094,0.201372],"study_design_scores_gemma":[0.001036031,0.0002081568,0.002156161,0.0005873355,0.00003993384,0.0000239185,0.0002298535,0.05081856,0.004320418,0.004556846,0.9349645,0.001058308],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0007108707,0.000452425,0.2161821,0.005784737,0.0007088355,0.0008126195,0.0002598894,0.0003226051,0.7747659],"genre_scores_gemma":[0.04240666,0.00004056411,0.8005719,0.000603557,0.0001032247,0.00002896099,0.00001548684,0.0001460984,0.1560835],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8457536,"threshold_uncertainty_score":0.9789779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004319261183433158,"score_gpt":0.1526893861195515,"score_spread":0.1483701249361183,"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."}}