{"id":"W3046501051","doi":"10.1109/rams48030.2020.9153652","title":"A Branch and Bound Algorithm for Single Machine Scheduling with Two Stages of Failure Process","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Branch and bound; Process (computing); Single-machine scheduling; Scheduling (production processes); Processor scheduling; Algorithm; Parallel computing; Mathematical optimization; Job shop scheduling; Mathematics; Embedded system; Schedule","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.00004760515,0.0001233049,0.0001744014,0.00003600417,0.00004047004,0.00004595928,0.00006209266,0.0000372061,0.00002636616],"category_scores_gemma":[0.00002142271,0.0001027987,0.00002033192,0.0001837522,0.00003032189,0.0001143899,0.000009581967,0.0000757046,8.477434e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006759871,"about_ca_system_score_gemma":0.00001486972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004632324,"about_ca_topic_score_gemma":0.000007992216,"domain_scores_codex":[0.9994528,0.000004412245,0.0001490653,0.0001528443,0.000101102,0.0001397974],"domain_scores_gemma":[0.999695,0.00003598732,0.0000281383,0.00006601491,0.00008669835,0.00008817467],"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.00004141424,0.00005895089,0.0013683,0.0008453249,0.0001746569,0.000003330733,0.002118754,0.9281924,0.006049085,0.0001806645,0.00004191745,0.06092525],"study_design_scores_gemma":[0.001111286,0.000126702,0.00001035834,0.00003108647,0.00002188958,0.00000616322,0.0003023903,0.9705827,0.02753582,0.00003932143,0.00007897228,0.0001532629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05605062,0.0004184885,0.9424518,0.0002903992,0.00003124075,0.0002015077,0.00002782955,0.0002563424,0.0002718144],"genre_scores_gemma":[0.5079636,0.000007106509,0.4918422,0.00006392896,0.00005242441,0.00001127638,0.00001253036,0.00002715202,0.0000197771],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.451913,"threshold_uncertainty_score":0.419201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01201173463728382,"score_gpt":0.232281277970498,"score_spread":0.2202695433332142,"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."}}