{"id":"W1614783246","doi":"10.1007/978-3-540-74484-9_89","title":"Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Maximization; Computer science; Scheduling (production processes); Minimax; Schedule; Minification; Job shop scheduling; Function (biology); Set (abstract data type); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007116942,0.001735671,0.001475004,0.001378451,0.0007847026,0.002667713,0.002512634,0.00145415,0.005737048],"category_scores_gemma":[0.02218976,0.0008082615,0.001214234,0.001783419,0.001455406,0.003109196,0.001669227,0.001600149,0.0005291975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001753308,"about_ca_system_score_gemma":0.001103067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979982,"about_ca_topic_score_gemma":0.003051165,"domain_scores_codex":[0.9943234,0.002487112,0.0002494075,0.0005301189,0.00168257,0.0007274329],"domain_scores_gemma":[0.987092,0.01024742,0.0005321283,0.0006499463,0.0011095,0.0003689659],"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.001044921,0.0001887876,0.001036696,0.0003041507,0.0001069448,0.0001932315,0.0001148213,0.8338073,0.00435972,0.0383567,0.003636601,0.1168502],"study_design_scores_gemma":[0.0000272767,0.00009012962,0.000132282,0.00002066081,0.00002139372,0.00004600689,0.00003545633,0.9764791,0.001799715,0.02081932,0.0005201132,0.000008565266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09957413,0.001464366,0.8799828,0.0006375327,0.0001821995,0.0001760842,0.0002208334,0.0007833433,0.01697874],"genre_scores_gemma":[0.6629282,0.0005664933,0.3312206,0.0001389352,0.0001509893,0.0001733434,0.0005602348,0.0003963165,0.003864788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007116942,"threshold_uncertainty_score":0.03763843,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0572420048960475,"score_gpt":0.283822231945605,"score_spread":0.2265802270495575,"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."}}