{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006330476,0.00088339,0.0006063008,0.0006347053,0.0005658455,0.000600725,0.0006902046,0.0003287942,0.001724594],"category_scores_gemma":[0.0008922784,0.0003733437,0.0006497229,0.0009117298,0.0004588421,0.000527671,0.0004585454,0.0007682625,0.0003264414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074423,"about_ca_system_score_gemma":0.001451796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004401876,"about_ca_topic_score_gemma":0.004791555,"domain_scores_codex":[0.9994586,0.0001449078,0.00001723309,0.00007476009,0.0002466668,0.00005786926],"domain_scores_gemma":[0.9997562,0.0001398582,0.00003302774,0.00001796612,0.00003842119,0.00001459154],"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":[0.0001359029,0.00007730569,0.0003790138,0.0004332304,0.00009402374,0.0001356638,0.00009330753,0.8048893,0.008927898,0.03739311,0.007516116,0.1399253],"study_design_scores_gemma":[0.000023271,0.00007093204,0.0004008342,0.00002210201,0.00001756279,0.00006287191,0.00001515629,0.9678402,0.002240491,0.02054816,0.008747151,0.00001126093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01962524,0.001938782,0.9655064,0.0002809833,0.0001896042,0.0001506754,0.0002087338,0.0004290269,0.01167045],"genre_scores_gemma":[0.3616342,0.002705027,0.6183442,0.00013639,0.0003549739,0.0006054348,0.0005411325,0.0004631859,0.01521547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004401876,"threshold_uncertainty_score":0.008752465,"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."}}