{"id":"W2968737012","doi":"10.1007/s11081-019-09461-2","title":"Adjustable Robust Optimization for multi-tasking scheduling with reprocessing due to imperfect tasks","year":2019,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Process Optimization and Integration","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Mathematical optimization; Dynamic priority scheduling; Distributed computing; Schedule; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001549771,0.0002585295,0.0002474602,0.0002628282,0.0001142637,0.0002112362,0.00008867921,0.0001166364,0.00007746275],"category_scores_gemma":[0.00008370243,0.0002578828,0.00003086905,0.0004865171,0.000008028628,0.0006855946,0.00001976797,0.0001262827,0.000004747187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008287484,"about_ca_system_score_gemma":0.00002517208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003512808,"about_ca_topic_score_gemma":0.000002333096,"domain_scores_codex":[0.9989416,0.000006538182,0.0002752804,0.0003360061,0.0001269401,0.0003136334],"domain_scores_gemma":[0.9994316,0.00003265558,0.00004817856,0.0001705145,0.0001858367,0.0001312078],"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.0000165039,0.000009829779,0.00009648647,0.0002650542,0.00002219567,5.617187e-7,0.0002343229,0.9976185,0.0008124502,0.00008108148,0.00002078389,0.0008222533],"study_design_scores_gemma":[0.0007668727,0.00005636761,0.0000339128,0.0002178857,0.00002175745,0.00001352742,0.0001441647,0.9963998,0.001768138,4.771948e-7,0.0002146396,0.0003625035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007762935,0.0002278816,0.9902497,0.00003677957,0.0002191149,0.0005748643,0.000007345648,0.0005725223,0.0003488651],"genre_scores_gemma":[0.2020826,0.00008966983,0.7972772,0.00006880555,0.00005759237,0.0001008862,0.0001067726,0.0001035472,0.000112995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1943196,"threshold_uncertainty_score":0.9999874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01149637073583505,"score_gpt":0.2112320773505336,"score_spread":0.1997357066146985,"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."}}