{"id":"W2518264398","doi":"10.1016/j.cor.2016.04.006","title":"Mixed Integer Programming models for job shop scheduling: A computational analysis","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Job shop scheduling; Constraint programming; Scheduling (production processes); Thread (computing); Algorithm; Mathematics; Stochastic programming; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"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.000723783,0.0001485048,0.000211808,0.0007972874,0.0003874926,0.0003312967,0.000302719,0.00009061415,0.00004010692],"category_scores_gemma":[0.0001250638,0.0001200769,0.0001426622,0.001388751,0.0001008869,0.0003245107,0.00006962584,0.0001817374,0.0000403669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000149867,"about_ca_system_score_gemma":0.000100558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014391,"about_ca_topic_score_gemma":0.00003668995,"domain_scores_codex":[0.9984047,0.00009321433,0.0003243129,0.0003318324,0.000413781,0.0004321886],"domain_scores_gemma":[0.9982091,0.0004668038,0.0000101366,0.0002740523,0.000880199,0.0001597537],"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.000006133778,0.00002984155,0.00005099462,0.00001240367,0.0002623694,9.689685e-7,0.0002539449,0.9694018,0.00006396375,0.006348775,0.0003582722,0.02321048],"study_design_scores_gemma":[0.0004904989,0.00003662791,0.00004857717,0.00003272866,0.00003484332,0.000001801701,0.0001168956,0.9981953,0.00011483,0.0004449724,0.0003134753,0.0001694757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01325295,0.0001190073,0.9846722,0.0008133823,0.0002434711,0.0004563302,0.0000236761,0.0002947579,0.0001241942],"genre_scores_gemma":[0.4467854,0.00001400285,0.5525792,0.00001782939,0.0001156574,0.0001851392,0.00006203312,0.00002586773,0.0002148157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4335325,"threshold_uncertainty_score":0.4896596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09631262454021754,"score_gpt":0.3475213637295705,"score_spread":0.251208739189353,"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."}}