{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699001,0.00143892,0.001166307,0.0008194752,0.0007597618,0.002551613,0.002052233,0.001648678,0.006234124],"category_scores_gemma":[0.009566697,0.001208184,0.001533442,0.00120062,0.0008403238,0.002758496,0.001063938,0.002775181,0.0006626674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283484,"about_ca_system_score_gemma":0.00169117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003598855,"about_ca_topic_score_gemma":0.005498435,"domain_scores_codex":[0.9986702,0.0008773428,0.0000351904,0.00009978608,0.0002220211,0.00009544948],"domain_scores_gemma":[0.9935527,0.00552105,0.0003605186,0.0001639557,0.0002723093,0.0001294804],"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.00006420682,0.000110869,0.0003209334,0.0001002097,0.00004194766,0.00004306549,0.00004426987,0.8904958,0.0003043098,0.09883339,0.001714193,0.007926886],"study_design_scores_gemma":[0.000005115587,0.000009726231,0.00002790054,0.000004031159,0.000005205009,0.000004740774,0.000007050286,0.9872152,0.00003224369,0.01244531,0.0002412309,0.000002273002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.033702,0.001627998,0.9509274,0.001387135,0.0001727552,0.0001146345,0.0003431339,0.0001601303,0.0115648],"genre_scores_gemma":[0.6160601,0.002078361,0.3626791,0.0005270845,0.0004124179,0.0006923104,0.0005231525,0.0002019058,0.01682553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006234124,"threshold_uncertainty_score":0.02085519,"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."}}