{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599898,0.0009870764,0.001699328,0.001044192,0.001034076,0.00158909,0.001786298,0.001421156,0.01410284],"category_scores_gemma":[0.002448005,0.0007577802,0.001030592,0.001392807,0.0006238703,0.001138634,0.001198301,0.002078005,0.001753603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002032321,"about_ca_system_score_gemma":0.003406644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01526076,"about_ca_topic_score_gemma":0.01231276,"domain_scores_codex":[0.9991369,0.0002415888,0.00004123727,0.0001562918,0.0001895517,0.0002345969],"domain_scores_gemma":[0.9982786,0.001191774,0.0001022956,0.00008616143,0.0001990347,0.000142062],"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.00024301,0.0001214283,0.0003784808,0.0001298394,0.00003337313,0.00006539677,0.00005862157,0.9226753,0.0009805709,0.00929495,0.003549732,0.06246933],"study_design_scores_gemma":[0.00002723139,0.00001727132,0.00004215846,0.000005338599,0.00000351264,0.000005332274,0.000006516512,0.9964325,0.0001158652,0.003030242,0.0003106811,0.000003224259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01971239,0.0005788234,0.9718402,0.0004365958,0.00008458782,0.0001830358,0.0001943003,0.001305364,0.005664745],"genre_scores_gemma":[0.3036306,0.0003186256,0.6881818,0.0001714632,0.00007450923,0.0005175738,0.0006330272,0.0003713869,0.006101116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01526076,"threshold_uncertainty_score":0.04717875,"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."}}